scientific article; zbMATH DE number 828046

MaRDI QIDQ4859012zbMATH OpenFDO

Authors Burkhard Monien, Ralf Diekmann, Robert Preis

Publication date 6 June 1996

zbMATH Keywords

graph bisections

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On the graph bisection problem
• A fast and robust network bisection algorithm
• Cut Size Statistics of Graph Bisection Heuristics
• An efficient algorithm for graph bisection of triangularizations
• Better Bounds for Graph Bisection

Cited in

(6)

• Vertex ordering and partitioning problems for random spatial graphs.
• A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms
• Optimal Cheeger cuts and bisections of random geometric graphs
• A better upper bound on the bisection width of de Bruijn networks (extended abstract)
• Communication throughput of interconnection networks
• Upper bounds on the bisection width of 3- and 4-regular graphs

Describes a project that uses

Uses Software

• Chaco
• Harwell-Boeing sparse matrix collection

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4859012)