Time constrained graph searching

DOI10.1016/J.TCS.2008.02.035zbMATH Open1146.68055OpenAlexW2070526994MaRDI QIDQ930887FDOQ930887

Authors: Brian Alspach, Danny Dyer, D. Hanson, Boting Yang 

Publication date: 24 June 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.035

Recommendations

• SOFSEM 2006: Theory and Practice of Computer Science
• Three-fast-searchable graphs
• Searching and sweeping graphs: a brief survey
• Searching for a Visible, Lazy Fugitive
• Searching for a Visible, Lazy Fugitive

zbMATH Keywords

graphsearching

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Handbook of Graph Theory
• Fugitive-search games on graphs and related parameters
• Searching and sweeping graphs: a brief survey
• Graph searching and interval completion
• Single step graph search problem

Cited In (6)

• The game of cops and eternal robbers
• Searching and sweeping graphs: a brief survey
• On a pursuit-evasion model without instantaneous movement
• Regular set of representatives for time-constrained MSC graphs
• Three-fast-searchable graphs
• Contiguous search problem in Sierpiński graphs

This page was built for publication: Time constrained graph searching

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