Algorithms – ESA 2005

DOI10.1007/11561071MaRDI QIDQ5475871zbMATH OpenOpenAlexFDO

Authors Martin Holzer, Grigorios Prasinos, Frank Schulz, Dorothea Wagner, Christos Zaroliagis

Publication date 27 June 2006

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

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

Mathematics Subject Classification ID

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

Recommendations

• Engineering planar separator algorithms
• Short and simple cycle separators in planar graphs
• Short and simple cycle separators in planar graphs
• Finding small simple cycle separators for 2-connected planar graphs
• scientific article; zbMATH DE number 1926663

Cited in

(6)

• I/O-Efficient Planar Separators
• Short and simple cycle separators in planar graphs
• Short and simple cycle separators in planar graphs
• Engineering planar separator algorithms
• Finding minimum balanced separators -- an exact approach
• Space efficient separator algorithms for planar graphs

This page was built for publication: Algorithms – ESA 2005

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