Searching is not jumping.

DOI10.1007/B93953MaRDI QIDQ5902509zbMATH OpenFDO

Authors Lali Barrière, Pierre Fraigniaud, N. Santoro, Dimitrios M. Thilikos

Publication date 12 January 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B93953

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Games involving graphs (91A43)

Recommendations

• Connected graph searching
• Monotonicity and inert fugitive search games
• scientific article; zbMATH DE number 176249
• Connected graph searching in chordal graphs
• SOFSEM 2006: Theory and Practice of Computer Science

Cited in

(45)

• Graph searching with advice
• Edge searching weighted graphs
• Sweeping graphs with large clique number
• Interval graphs and searching
• Searching and pebbling
• Approximate search strategies for weighted trees
• Four-searchable biconnected outerplanar graphs
• Distributed graph searching with a sense of direction
• The cost of monotonicity in distributed graph searching
• A distributed algorithm for computing the node search number in trees
• Three-fast-searchable graphs
• Lions and contamination: monotone clearings
• Graph searching and interval completion
• Monotonicity and inert fugitive search games
• The search and the node-search number of dual graphs
• Exclusive graph searching
• A min-max theorem for LIFO-search
• Contraction obstructions for connected graph searching
• More agents may decrease global work: a case in butterfly decontamination
• Connected Graph Searching in Outerplanar Graphs
• Searching Trees with Sources and Targets
• Monotony Properties of Connected Visible Graph Searching
• Connected graph searching for unicyclic graphs
• Arc Searching Digraphs Without Jumping
• On minimum cost edge searching
• scientific article; zbMATH DE number 176249 (Why is no real title available?)
• Searching expenditure and interval graphs
• scientific article; zbMATH DE number 1472189 (Why is no real title available?)
• A linear fixed parameter tractable algorithm for connected pathwidth
• Exclusive graph searching
• Integer programming models and algorithms for the graph decontamination problem with mobile agents
• scientific article; zbMATH DE number 7651203 (Why is no real title available?)
• Connected search for a lazy robber
• Graph parameters, universal obstructions, and WQO
• Connected graph searching
• A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
• Network decontamination under m-immunity
• An annotated bibliography on guaranteed graph searching
• Distributed chasing of network intruders
• Monotonicity in digraph search problems
• Connected graph searching in chordal graphs
• A graph search algorithm for indoor pursuit/evasion
• CSP duality and trees of bounded pathwidth
• Maximum vertex occupation time and inert fugitive: Recontamination does help
• Monotony properties of connected visible graph searching

This page was built for publication: Searching is not jumping.

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