Space efficient separator algorithms for planar graphs

DOI10.1007/978-3-030-39881-1_2MaRDI QIDQ782148zbMATH OpenOpenAlexFDO

Authors Osamu Watanabe

Publication date 22 July 2020

Full work available at URL https://doi.org/10.1007/978-3-030-39881-1_2

zbMATH Keywords

separator theoremspace-efficient algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Planar Separators
• Engineering planar separator algorithms
• Algorithms – ESA 2005
• scientific article; zbMATH DE number 867693
• Finding small simple cycle separators for 2-connected planar graphs

Cited in

(4)

• I/O-Efficient Planar Separators
• scientific article; zbMATH DE number 4091555 (Why is no real title available?)
• An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications
• scientific article; zbMATH DE number 867693 (Why is no real title available?)

This page was built for publication: Space efficient separator algorithms for planar graphs

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