Exclusive graph searching
From MaRDI portal
Publication:521823
DOI10.1007/s00453-016-0124-0zbMath1364.68304OpenAlexW2306674958MaRDI QIDQ521823
Lélia Blin, Nicolas Nisse, Janna Burman
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
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Edge search number of cographs
- Connected graph searching
- Exclusive graph searching vs. pathwidth
- An annotated bibliography on guaranteed graph searching
- Sweeping graphs with large clique number
- The vertex separation and search number of a graph
- Edge and node searching problems on trees
- Searching and pebbling
- Exclusive Graph Searching
- Mixed search number and linear-width of interval and split graphs
- Pathwidth of Circular-Arc Graphs
- The complexity of searching a graph
- Monotonicity in graph searching
- Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
- From Pathwidth to Connected Pathwidth
This page was built for publication: Exclusive graph searching
