The minimum shared edges problem on grid-like graphs

DOI10.1007/978-3-319-68705-6_19zbMath1483.05179arXiv1703.02332OpenAlexW2597626543MaRDI QIDQ1687922

Hendrik Molter, Till Fluschnik, Meike Hatzel, Steffen Härtlein, Henning Seidler

Publication date: 4 January 2018

Full work available at URL: https://arxiv.org/abs/1703.02332

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

The complexity of routing with collision avoidance ⋮ The parameterized complexity of the minimum shared edges problem

This page was built for publication: The minimum shared edges problem on grid-like graphs