Next Article in Journal
Fairness in Algorithmic Decision-Making: Applications in Multi-Winner Voting, Machine Learning, and Recommender Systems
Previous Article in Journal
Compression Challenges in Large Scale Partial Differential Equation Solvers
Previous Article in Special Issue
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies
Open AccessArticle

Correspondence between Multilevel Graph Partitions and Tree Decompositions

by Michael Hamann 1,* and Ben Strasser 2,*,†
Karlsruhe Institute of Technology, 76131 Karlsruhe, Germany
Independent Researcher, 71149 Bondorf, Germany
Authors to whom correspondence should be addressed.
Work was partially done while at Karlsruhe Institute of Technology.
Algorithms 2019, 12(9), 198;
Received: 28 June 2019 / Revised: 9 September 2019 / Accepted: 9 September 2019 / Published: 17 September 2019
(This article belongs to the Special Issue Graph Partitioning: Theory, Engineering, and Applications)
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. View Full-Text
Keywords: graph theory; tree decomposition; graph partition graph theory; tree decomposition; graph partition
Show Figures

Figure 1

MDPI and ACS Style

Hamann, M.; Strasser, B. Correspondence between Multilevel Graph Partitions and Tree Decompositions. Algorithms 2019, 12, 198.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Search more from Scilit
Back to TopTop