Fission: Practical algorithms for computing minimum balanced node separators
From MaRDI portal
Publication:6115756
DOI10.1142/s1793830922500483OpenAlexW4200115454MaRDI QIDQ6115756
Johannes Blum, Ruoying Li, Sabine Storandt
Publication date: 13 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830922500483
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Search-space size in contraction hierarchies
- Graph clustering
- A framework for solving VLSI graph layout problems
- Parameterized graph separation problems
- Treewidth lower bounds with brambles
- Finding good approximate vertex and edge partitions is NP-hard
- Measuring the vulnerability for classes of intersection graphs
- Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
- Finding small balanced separators
- Engineering Multilevel Graph Partitioning Algorithms
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Graph Bisection with Pareto Optimization
- Multiway cuts in node weighted graphs
- Breaking the multicommodity flow barrier for o(√log n)-approximations to sparsest cut
- Distributed Evolutionary Graph Partitioning
- Customizable Contraction Hierarchies
- Contraction and Treewidth Lower Bounds
- Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
- Engineering planar separator algorithms
- A Polylogarithmic Approximation of the Minimum Bisection
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- Nested Dissection of a Regular Finite Element Mesh
- Graph partitioning using single commodity flows
