scientific article; zbMATH DE number 1834674

zbMath0999.68159MaRDI QIDQ4779170

Burkhard Monien, Robert Preis

Publication date: 25 November 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360524

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

regular graphsgraph partitioningbisection widthlocal improvement

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

Four Shorts Stories on Surprising Algorithmic Uses of Treewidth ⋮ Bounds on the max and min bisection of random cubic and random 4-regular graphs ⋮ Bounds on the bisection width for random \(d\)-regular graphs ⋮ Upper bounds on the bisection width of 3- and 4-regular graphs ⋮ New spectral lower bounds on the bisection width of graphs ⋮ On the minimum bisection of random 3-regular graphs ⋮ Computation of best possible low degree expanders ⋮ Pathwidth of cubic graphs and exact algorithms

This page was built for publication: