On the graph bisection problem

DOI10.1109/81.250179zbMATH Open0768.05056OpenAlexW2004060442MaRDI QIDQ4033892FDOQ4033892

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

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

zbMATH Keywords

boundoptimal bisectionoptimal cost

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (16)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some optimization problems on weak-bisplit graphs
• Minimum bisection is NP-hard on unit disk graphs
• A fuzzy clustering algorithm for graph bisection
• Title not available (Why is that?)
• A fast and robust network bisection algorithm
• Better Bounds 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)