Contracting planar graphs efficiently in parallel

DOI10.1007/3-540-54967-6_78MaRDI QIDQ4246713zbMATH OpenFDO

Authors Balaji Raghavachari, Martin Fürer

Publication date 16 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54967-6_78

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: Contracting planar graphs efficiently in parallel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246713)