The hardness of routing two pairs on one face
From MaRDI portal
Publication:662307
DOI10.1007/s10107-010-0343-0zbMath1232.05110arXiv0911.3024OpenAlexW2101073480MaRDI QIDQ662307
Publication date: 22 February 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.3024
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)
Related Items
On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems ⋮ Multiflow Feasibility: An Annotated Tableau
Cites Work