On the graph bisection problem
From MaRDI portal
Publication:4033892
Recommendations
Cited in
(18)- On judicious bisections of graphs
- scientific article; zbMATH DE number 828046 (Why is no real title available?)
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem
- Some optimization problems on weak-bisplit graphs
- Graph bisection revisited
- A fast and robust network bisection algorithm
- An exact combinatorial algorithm for minimum graph bisection
- Minimum bisection is NP-hard on unit disk graphs
- scientific article; zbMATH DE number 666305 (Why is no real title available?)
- scientific article; zbMATH DE number 5237020 (Why is no real title available?)
- scientific article; zbMATH DE number 1333614 (Why is no real title available?)
- scientific article; zbMATH DE number 176141 (Why is no real title available?)
- Better Bounds for Graph Bisection
- Investigations on the bisection problem
- An efficient algorithm for graph bisection of triangularizations
- scientific article; zbMATH DE number 6303002 (Why is no real title available?)
- scientific article; zbMATH DE number 4131663 (Why is no real title available?)
- A fuzzy clustering algorithm for graph bisection
This page was built for publication: On the graph bisection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033892)