Algorithms for finding noncrossing Steiner forests in plane graphs

DOI10.1007/3-540-46632-0_34MaRDI QIDQ4511236zbMATH OpenFDO

Authors Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki

Publication date 6 March 2001

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

Full work available at URL https://doi.org/10.1007/3-540-46632-0_34

zbMATH Keywords

Steiner forest

Mathematics Subject Classification ID

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

Recommendations

• Finding a noncrossing Steiner forest in plane graphs under a 2-face condition
• Shortest non-crossing walks in the plane
• scientific article; zbMATH DE number 508831
• scientific article; zbMATH DE number 833766
• Colored Non-crossing Euclidean Steiner Forest

Cited in

(5)

• Colored Non-crossing Euclidean Steiner Forest
• Non-crossing connectors in the plane
• Non-crossing geometric Steiner arborescences
• Shortest non-crossing walks in the plane
• Finding a noncrossing Steiner forest in plane graphs under a 2-face condition

This page was built for publication: Algorithms for finding noncrossing Steiner forests in plane graphs

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