ORPP logo

Graph Partitioning and Graph Clustering. (Record no. 68776)

MARC details
000 -LEADER
fixed length control field 05929nam a22005173i 4500
001 - CONTROL NUMBER
control field EBC3113242
003 - CONTROL NUMBER IDENTIFIER
control field MiAaPQ
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240729124537.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS
fixed length control field m o d |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr cnu||||||||
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 240724s2013 xx o ||||0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780821898697
Qualifying information (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Canceled/invalid ISBN 9780821890387
035 ## - SYSTEM CONTROL NUMBER
System control number (MiAaPQ)EBC3113242
035 ## - SYSTEM CONTROL NUMBER
System control number (Au-PeEL)EBL3113242
035 ## - SYSTEM CONTROL NUMBER
System control number (CaPaEBR)ebr10878697
035 ## - SYSTEM CONTROL NUMBER
System control number (OCoLC)840599907
040 ## - CATALOGING SOURCE
Original cataloging agency MiAaPQ
Language of cataloging eng
Description conventions rda
-- pn
Transcribing agency MiAaPQ
Modifying agency MiAaPQ
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA166.245 -- .D56 2013eb
082 0# - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 511/.5
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Bader, David A.
245 10 - TITLE STATEMENT
Title Graph Partitioning and Graph Clustering.
250 ## - EDITION STATEMENT
Edition statement 1st ed.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Providence :
Name of producer, publisher, distributor, manufacturer American Mathematical Society,
Date of production, publication, distribution, manufacture, or copyright notice 2013.
264 #4 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Date of production, publication, distribution, manufacture, or copyright notice ©2013.
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource (258 pages)
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
490 1# - SERIES STATEMENT
Series statement Contemporary Mathematics ;
Volume/sequential designation v.588
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Intro -- Preface -- 1. Introducing the 10th Challenge - Graph Partitioning and Graph Clustering -- 2. Key Results -- 3. Challenge Description -- 4. Contributions to this Collection -- 5. Directions for Further Research -- High quality graph partitioning -- 1. Introduction -- 2. Preliminaries -- 3. Related Work -- 4. Karlsruhe Fast Flow Partitioner -- 5. KaFFPa Evolutionary -- 6. Experiments -- 7. Conclusion and Future Work -- References -- Abusing a hypergraph partitioner for unweighted graph partitioning -- 1. Introduction -- 2. Mondriaan -- 3. Results -- 4. Conclusion -- References -- Parallel partitioning with Zoltan: Is hypergraph partitioning worth it? -- 1. Introduction -- 2. Models and Metrics -- 3. Overview of the Zoltan Hypergraph Partitioner -- 4. Experiments -- 5. Conclusions -- Acknowledgements -- References -- UMPa: A multi-objective, multi-level partitioner for communication minimization -- 1. Introduction -- 2. Background -- 3. UMPa: A multi-objective partitioning tool for communication minimization -- 4. Experimental results -- 5. Conclusions and future work -- References -- Appendix A. DIMACS Challenge Results -- Shape optimizing load balancing for MPI-parallel adaptive numerical simulations -- 1. Introduction -- 2. Related Work -- 3. Diffusion-based Repartitioning with DibaP -- 4. PDibaP: Parallel DibaP for Repartitioning -- 5. Experiments -- 6. Conclusions -- References -- Graph partitioning for scalable distributed graph computations -- 1. Introduction -- 2. Parallel Breadth-first Search -- 3. Analysis of Communication Costs -- 4. Graph and Hypergraph Partitioning Metrics -- 5. Experimental Setup -- 6. Microbenchmarking Collectives Performance -- 7. Performance Analysis and Results -- 8. Conclusions and Future Work -- Acknowledgments -- References -- Appendix on edge count per processor.
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note Using graph partitioning for efficient network modularity optimization -- 1. Introduction -- 2. Reduction of modularity optimization to minimum weighted cut -- 3. Implementation of the modularity optimization algorithm based on the Metis package -- 4. Comparison on DIMACS testbed graphs -- 5. Conclusion -- References -- Modularity maximization in networks by variable neighborhood search -- 1. Introduction -- 2. Description of the heuristic -- 3. Description of the exact method -- 4. Experimental Results -- 5. Conclusion -- References -- Network clustering via clique relaxations: A community based approach -- 1. Introduction -- 2. Background -- 3. Clustering Algorithm -- 4. Computational Results -- 5. Conclusion -- Acknowledgements -- References -- Identifying base clusters and their application to maximizing modularity -- 1. Introduction -- 2. Background -- 3. Finding Base Clusters in Complex Networks -- 4. Modularity Maximization Using Base Clusters -- 5. Discussion and Future Work -- References -- Complete hierarchical cut-clustering: A case study on expansion and modularity -- 1. Introduction -- 2. Preliminaries -- 3. Experimental Study -- 4. Conclusion -- References -- A partitioning-based divisive clustering technique for maximizing the modularity -- 1. Introduction -- 2. Background -- 3. Algorithms -- 4. Experiments -- 5. Conclusion -- Acknowledgment -- References -- Appendix A. DIMACS Challenge results -- An ensemble learning strategy for graph clustering -- 1. Introduction -- 2. Ensemble Learning -- 3. Core Groups Graph Clustering Scheme -- 4. Modularity and its Optimization -- 5. Evaluation -- 6. A Global Analysis View on the CGGC Scheme -- 7. Conclusion -- References -- Parallel community detection for massive graphs -- 1. Communities in Graphs -- 2. Parallel Agglomerative Community Detection.
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note 3. Mapping the Agglomerative Algorithm to Threaded Platforms -- 4. Parallel Performance -- 5. Related Work -- 6. Observations -- Acknowledgments -- References -- Graph coarsening and clustering on the GPU -- 1. Introduction -- 2. Clustering -- 3. Coarsening -- 4. Parallel implementation -- 5. Results -- 6. Conclusion -- 7. Appendix -- Acknowledgements -- References.
588 ## - SOURCE OF DESCRIPTION NOTE
Source of description note Description based on publisher supplied metadata and other sources.
590 ## - LOCAL NOTE (RLIN)
Local note Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Graph algorithms -- Congresses.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Graph theory -- Congresses.
655 #4 - INDEX TERM--GENRE/FORM
Genre/form data or focus term Electronic books.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Meyerhenke, Henning.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Sanders, Peter.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Wagner, Dorothea.
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Print version:
Main entry heading Bader, David A.
Title Graph Partitioning and Graph Clustering
Place, publisher, and date of publication Providence : American Mathematical Society,c2013
International Standard Book Number 9780821890387
797 2# - LOCAL ADDED ENTRY--CORPORATE NAME (RLIN)
Corporate name or jurisdiction name as entry element ProQuest (Firm)
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Contemporary Mathematics
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://ebookcentral.proquest.com/lib/orpp/detail.action?docID=3113242">https://ebookcentral.proquest.com/lib/orpp/detail.action?docID=3113242</a>
Public note Click to View

No items available.

© 2024 Resource Centre. All rights reserved.