scientific article; zbMATH DE number 828046
From MaRDI portal
Publication:4859012
zbMath0838.68084MaRDI QIDQ4859012
Burkhard Monien, Robert Preis, Ralf Diekmann
Publication date: 6 June 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15)
Related Items (6)
Vertex ordering and partitioning problems for random spatial graphs. ⋮ A better upper bound on the bisection width of de Bruijn networks ⋮ Upper bounds on the bisection width of 3- and 4-regular graphs ⋮ Optimal Cheeger cuts and bisections of random geometric graphs ⋮ Communication throughput of interconnection networks ⋮ A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms
Uses Software
This page was built for publication: