Partitioning planar graphs with vertex costs: Algorithms and applications

DOI10.1007/s004530010031zbMath0959.68098OpenAlexW2017376066MaRDI QIDQ1578391

Hristo N. Djidjev

Publication date: 27 August 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004530010031

zbMATH Keywords

graph pebblingmulticommodity flow problemsgraph embedding problems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Continuous quadratic programming formulations of optimization problems on graphs ⋮ A quality and distance guided hybrid algorithm for the vertex separator problem ⋮ Algorithms for approximate shortest path queries on weighted polyhedral surfaces ⋮ Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem ⋮ On cleaving a planar graph ⋮ Planar crossing numbers of graphs of bounded genus ⋮ The vertex separator problem: a polyhedral investigation

This page was built for publication: Partitioning planar graphs with vertex costs: Algorithms and applications