Partitioning planar graphs with costs and weights

DOI10.1145/1187436.1210588zbMath1143.05329OpenAlexW2170069407MaRDI QIDQ3507765

Hua Guo, Hristo N. Djidjev, Lyudmil Aleksandrov, Anil Maheshwari

Publication date: 20 June 2008

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1187436.1210588

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Algorithms for approximate shortest path queries on weighted polyhedral surfaces

This page was built for publication: Partitioning planar graphs with costs and weights