Graph Bisection with Pareto Optimization
From MaRDI portal
Publication:4577953
DOI10.1145/3173045zbMath1414.68141arXiv1504.03812OpenAlexW2963809597MaRDI QIDQ4577953
Publication date: 6 August 2018
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.03812
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
An analysis of the parameterized complexity of periodic timetabling, Fission: Practical algorithms for computing minimum balanced node separators, Unnamed Item, The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth., PACE Solver Description: Tree Depth with FlowCutter, Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm, Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies, A predictive fault tolerant control method for qLPV systems subject to input faults and constraints, ProCount: weighted projected model counting with graded project-join trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- An exact combinatorial algorithm for minimum graph bisection
- Most balanced minimum cuts
- The analysis of a nested dissection algorithm
- Optimal node ranking of trees
- Some simplified NP-complete graph problems
- Inference in belief networks: A procedural guide
- Optimal node ranking of tree in linear time
- A combined evolutionary search and multilevel optimisation approach to graph-partitioning
- Incidence matrices and interval graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The Elimination form of the Inverse and its Application to Linear Programming
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Maximal Flow Through a Network
- Preprocessing Speed-Up Techniques Is Hard
- The Evolution of the Minimum Degree Ordering Algorithm
- Generalized Nested Dissection
- Power of Natural Semijoins
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Graph Partitioning and Graph Clustering
- Graph Bisection with Pareto-Optimization
- Exact Combinatorial Branch-and-Bound for Graph Bisection
- Customizable Contraction Hierarchies
- Search-Space Size in Contraction Hierarchies
- Engineering multilevel overlay graphs for shortest-path queries
- Treewidth: Structure and Algorithms
- Dijkstra's algorithm on-line
- Nested Dissection of a Regular Finite Element Mesh
