Better Bounds for Graph Bisection
From MaRDI portal
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Recommendations
- Graph bisection revisited
- On judicious bisections of graphs
- On the parameterized complexity of computing graph bisections
- New spectral lower bounds on the bisection width of graphs
- scientific article; zbMATH DE number 1696519
- On the graph bisection problem
- scientific article; zbMATH DE number 1817784
- scientific article; zbMATH DE number 666305
- Exact combinatorial branch-and-bound for graph bisection
- scientific article; zbMATH DE number 1762086
Cited in
(12)- Graph bisection revisited
- scientific article; zbMATH DE number 1696519 (Why is no real title available?)
- Faster and more dynamic maximum flow by incremental breadth-first search
- scientific article; zbMATH DE number 1875431 (Why is no real title available?)
- Nonpolyhedral Relaxations of Graph-Bisection Problems
- scientific article; zbMATH DE number 828046 (Why is no real title available?)
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
- scientific article; zbMATH DE number 7286677 (Why is no real title available?)
- Bisections above Tight Lower Bounds
- Exact combinatorial branch-and-bound for graph bisection
- ILP-Based Local Search for Graph Partitioning
- An exact combinatorial algorithm for minimum graph bisection
This page was built for publication: Better Bounds for Graph Bisection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912858)
