On the graph bisection problem

DOI10.1109/81.250179MaRDI QIDQ4033892zbMATH OpenOpenAlexFDO

Authors Vasant B. Rao, Youssef G. Saab

Publication date 16 May 1993

Published in IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/81.250179

zbMATH Keywords

boundoptimal bisectionoptimal cost

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Approximating the minimum bisection size (extended abstract)
• scientific article; zbMATH DE number 666305
• A genetic algorithm for graph bisection
• A fast and robust network bisection algorithm
• scientific article; zbMATH DE number 1333614

Cited in

(18)

• Better Bounds for Graph Bisection
• A fast and robust network bisection algorithm
• scientific article; zbMATH DE number 828046 (Why is no real title available?)
• Graph bisection revisited
• On judicious bisections of graphs
• An exact combinatorial algorithm for minimum graph bisection
• A deterministic annealing algorithm for approximating a solution of the min-bisection problem
• scientific article; zbMATH DE number 1333614 (Why is no real title available?)
• 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 4131663 (Why is no real title available?)
• scientific article; zbMATH DE number 6303002 (Why is no real title available?)
• Some optimization problems on weak-bisplit graphs
• Minimum bisection is NP-hard on unit disk graphs
• Investigations on the bisection problem
• A fuzzy clustering algorithm for graph bisection
• An efficient algorithm for graph bisection of triangularizations
• scientific article; zbMATH DE number 176141 (Why is no real title available?)

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)