scientific article; zbMATH DE number 1929926

zbMath1014.68115MaRDI QIDQ4708558

Marek Karpinski

Publication date: 18 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2420/24200059.htm

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (11)

Solving the minimum bisection problem using a biologically inspired computational model ⋮ Minimum bisection is NP-hard on unit disk graphs ⋮ Optimal cuts and partitions in tree metrics in polynomial time ⋮ Upper bounds on minimum balanced bipartitions ⋮ Generating All Patterns of Graph Partitions Within a Disparity Bound ⋮ Some heuristics for the binary paint shop problem and their expected number of colour changes ⋮ On minimum balanced bipartitions of triangle-free graphs ⋮ Approximation algorithms for the Bipartite Multicut problem ⋮ Two new integer linear programming formulations for the vertex bisection problem ⋮ Coloring Graphs with Minimal Edge Load ⋮ MAXIMUM BALANCED 3-PARTITIONS OF GRAPHS

This page was built for publication: