scientific article
From MaRDI portal
Publication:2957511
DOI10.4230/LIPIcs.FSTTCS.2012.337zbMath1354.68110MaRDI QIDQ2957511
Publication date: 26 January 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Finding shortest paths between graph colourings ⋮ Rerouting shortest paths in planar graphs ⋮ Finding Shortest Paths Between Graph Colourings ⋮ The complexity of rerouting shortest paths ⋮ Reconfiguration in bounded bandwidth and tree-depth ⋮ Reconfiguration on sparse graphs ⋮ Introduction to reconfiguration
This page was built for publication:
