Selecting vertex disjoint paths in plane graphs

DOI10.1002/net.21618zbMath1390.90158OpenAlexW1486518752MaRDI QIDQ4642445

Yusuke Kobayashi, Anna Zych, Anita Schöbel, Matúš Mihalák, Holger Flier, Peter Widmayer

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21618

zbMATH Keywords

complexityalgorithmsnetworksroutingpath problemsrailways

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Selecting vertex disjoint paths in plane graphs