From Pathwidth to Connected Pathwidth
From MaRDI portal
Publication:3113706
DOI10.4230/LIPIcs.STACS.2011.416zbMath1229.05254arXiv1007.1269OpenAlexW2591867287MaRDI QIDQ3113706
Publication date: 23 January 2012
Full work available at URL: https://arxiv.org/abs/1007.1269
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57) Graph designs and isomorphic decomposition (05C51)
Related Items (3)
Approximate search strategies for weighted trees ⋮ Connected graph searching ⋮ Connected searching of weighted trees
This page was built for publication: From Pathwidth to Connected Pathwidth