Finding a noncrossing Steiner forest in plane graphs under a 2-face condition

DOI10.1023/A:1011425821069zbMath1002.90081OpenAlexW1491560029MaRDI QIDQ5943823

Daisuke Masubuchi, Takao Nishizeki, Yoshiyuki Kusakari

Publication date: 21 January 2003

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011425821069

zbMATH Keywords

algorithmplane graphnoncrossingSteiner tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Combinatorial optimization (90C27)

Related Items (2)

Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time ⋮ Non-crossing shortest paths in undirected unweighted planar graphs in linear time

This page was built for publication: Finding a noncrossing Steiner forest in plane graphs under a 2-face condition