Correspondence between Multilevel Graph Partitions and Tree Decompositions
We present a mapping between rooted tree decompositions and node separator based multilevel graph partitions. Significant research into both tree decompositions and graph partitions exists. We hope that our result allows for an easier knowledge transfer between the two research avenues.
Main Authors: | Michael Hamann, Ben Strasser |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-09-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/12/9/198 |
Similar Items
-
Graph labelings and decompositions by partitioning sets of integers
by: Moragas Vilarnau, Jordi
Published: (2010) -
Tree Graphs and Orthogonal Spanning Tree Decompositions
by: Mahoney, James Raymond
Published: (2016) -
Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem
by: KHAN, Muhammad Umair
Published: (2010) -
Distributed graph decomposition algorithms on Apache Spark
by: Mandal, Aritra
Published: (2018) -
Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem
by: Inkmann, Torsten
Published: (2008)