Three-fast-searchable graphs

DOI10.1016/j.dam.2013.03.004zbMath1286.05166OpenAlexW2132813033MaRDI QIDQ2446838

Dariusz Dereniowski, Öznur Yaşar Diner, Danny Dyer

Publication date: 22 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.03.004

zbMATH Keywords

computational complexitygraph searchingfast searching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Fast searching on \(k\)-combinable graphs, Edge searching and fast searching with constraints, Fast Searching on Complete k-partite Graphs, Fast edge searching and fast searching on graphs, Fast searching on cactus graphs, Fast Searching on Cartesian Products of Graphs, The fast search number of a Cartesian product of graphs, The fast search number of a complete \(k\)-partite graph

Cites Work

• Unnamed Item
• Fast edge searching and fast searching on graphs
• Time constrained graph searching
• An annotated bibliography on guaranteed graph searching
• Sweeping graphs with large clique number
• The vertex separation number of a graph equals its path-width
• On the pathwidth of chordal graphs
• The vertex separation and search number of a graph
• Balanced vertex-orderings of graphs
• Searching and pebbling
• Searching Trees with Sources and Targets
• On the Fast Searching Problem
• The complexity of searching a graph
• Monotonicity in graph searching
• Cleaning Regular Graphs with Brushes
• Recontamination does not help to search a graph
• Graph-Theoretic Concepts in Computer Science