scientific article; zbMATH DE number 1522940

zbMATH Open0963.68157MaRDI QIDQ4511236FDOQ4511236

Authors: Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki 

Publication date: 6 March 2001

Title of this publication is not available (Why is that?)

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
• Publication:4860272
• Colored Non-crossing Euclidean Steiner Forest

zbMATH Keywords

Steiner forest

Mathematics Subject Classification ID

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

Cited In (5)

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

This page was built for publication:

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