Exclusive graph searching

DOI10.1007/S00453-016-0124-0MaRDI QIDQ521823zbMATH OpenOpenAlexFDO

Authors Lélia Blin, J. Burman, Nicolas Nisse

Publication date 12 April 2017

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-016-0124-0

zbMATH Keywords

exclusivitygraph searchingpathwidthtrees

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Exclusive graph searching
• Exclusive graph searching vs. pathwidth
• Searching is not jumping.
• SOFSEM 2006: Theory and Practice of Computer Science
• Connected graph searching

Cites work

• An annotated bibliography on guaranteed graph searching
• Connected graph searching
• Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
• Edge and node searching problems on trees
• Edge search number of cographs
• Exclusive graph searching
• Exclusive graph searching vs. pathwidth
• From pathwidth to connected pathwidth
• scientific article; zbMATH DE number 3650583 (Why is no real title available?)
• scientific article; zbMATH DE number 176249 (Why is no real title available?)
• Mixed search number and linear-width of interval and split graphs
• Monotonicity in graph searching
• Pathwidth of Circular-Arc Graphs
• Searching and pebbling
• Sweeping graphs with large clique number
• The complexity of searching a graph
• The vertex separation and search number of a graph

Cited in

(2)

• Exclusive graph searching
• Exclusive graph searching vs. pathwidth

This page was built for publication: Exclusive graph searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521823)