Graph searching, elimination trees, and a generalization of bandwidth

DOI10.1007/s00453-004-1117-yzbMath1082.68082OpenAlexW2026616451WikidataQ60488773 ScholiaQ60488773MaRDI QIDQ1763148

Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle

Publication date: 21 February 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1117-y

zbMATH Keywords

BandwidthElimination treeChordal graphGraph searchingTree decomposition

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (12)

Edge-bandwidth of grids and tori ⋮ On minimum cost edge searching ⋮ Digraph measures: Kelly decompositions, games, and orderings ⋮ An annotated bibliography on guaranteed graph searching ⋮ The complexity of minimum-length path decompositions ⋮ Digraph searching, directed vertex separation and directed pathwidth ⋮ Four-searchable biconnected outerplanar graphs ⋮ On tradeoffs between width- and fill-like graph parameters ⋮ Maximum vertex occupation time and inert fugitive: Recontamination does help ⋮ Searching by heterogeneous agents ⋮ Edge searching weighted graphs ⋮ Lower bounds on treespan

This page was built for publication: Graph searching, elimination trees, and a generalization of bandwidth