NDLI: Tree-Based Coarsening and Partitioning of Complex Networks

Please wait, while we are loading the content...

Tree-Based Coarsening and Partitioning of Complex Networks

Content Provider	ACM Digital Library
Author	Glantz, Roland Meyerhenke, Henning Schulz, Christian
Copyright Year	2016
Description	Author Affiliation: Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany (Glantz, Roland; Meyerhenke, Henning; Schulz, Christian)
Abstract	A hierarchy of increasingly coarse versions of a network allows one to represent the network on multiple scales at the same time. Often, the elementary operation for generating a hierarchy on a network is merging adjacent vertices, an operation that can be realized through contracting the edge between the two vertices. Such a hierarchy is defined by the selection of the edges to be contracted between a level and the next coarser level. The selection may involve (i) rating the edges, (ii) constraining the selection (e.g., that the selected edges form a matching), as well as (iii) maximizing the total rate of the selected edges under the constraints. Hierarchies of this kind are, among others, involved in multilevel methods for partitioning networks—a prerequisite for processing in parallel with distributed memory. In this article, we propose a new edge rating by (i) defining weights for the edges of a network that express the edges’ importance for connectivity via shortest paths, (ii) computing a minimum weight spanning tree with respect to these weights, and (iii) rating the network edges based on the conductance values of the tree’s fundamental cuts. To make the computation of our new edge rating efficient, we develop the first optimal linear-time algorithm to compute the conductance values of $\textit{all}$ fundamental cuts of a given spanning tree. We integrate the new edge rating into a leading multilevel graph partitioner and equip the latter also with a new greedy postprocessing for optimizing the Maximum Communication Volume (MCV) of a partition. Our experiments, in which we bipartition frequently used benchmark networks, show that the postprocessing reduces MCV by 11.3%. Our new edge rating, here used for matching-based coarsening, further reduces MCV by 10.3% compared to the previously best rating with MCV postprocessing in place for both ratings. In total, with a modest increase in running time, our new approach reduces the MCV of complex network partitions by 20.4%.
Starting Page	1
Ending Page	20
Page Count	20
File Format	PDF
ISSN	10846654
e-ISSN	10846654
DOI	10.1145/2851496
Journal	Journal of Experimental Algorithmics (JEA)
Volume Number	21
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-01-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Graph coarsening Complex networks Conductance Fundamental cuts Multilevel graph partitioning Spanning trees
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Advanced Coarsening Schemes for Graph Partitioning

Partitioning Bispanning Graphs into Spanning Trees

On Family of Graphs with Minimum Number of Spanning Trees

Diameter-Preserving Spanning Trees in Sparse Weighted Graphs

Algorithm 399: Spanning tree

The Number of Spanning Trees in Kn-Complements of Quasi-Threshold Graphs

Tree-based Coarsening and Partitioning of Complex Networks

Closure and Spanning k-Trees

An algorithm for finding a fundamental set of cycles of a graph

Tree-Based Coarsening and Partitioning of Complex Networks

Similar Documents

Advanced Coarsening Schemes for Graph Partitioning

Partitioning Bispanning Graphs into Spanning Trees

On Family of Graphs with Minimum Number of Spanning Trees

Diameter-Preserving Spanning Trees in Sparse Weighted Graphs

Algorithm 399: Spanning tree

The Number of Spanning Trees in Kn-Complements of Quasi-Threshold Graphs

Tree-based Coarsening and Partitioning of Complex Networks

Closure and Spanning k-Trees

An algorithm for finding a fundamental set of cycles of a graph

Tree-Based Coarsening and Partitioning of Complex Networks