\(k\)-chordal graphs: from cops and robber to compact routing via treewidth

DOI10.1007/s00453-014-9871-yzbMath1328.68152WikidataQ62046034 ScholiaQ62046034MaRDI QIDQ494802

Yong-Cai Geng, Sumit K. Garg

Publication date: 2 September 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-014-9871-y

zbMATH Keywords

treewidth; chordality; compact routing; cops and robber games

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C57: Games on graphs (graph-theoretic aspects)

Uses Software

• Algorithm 447