Pursuing a fast robber on a graph
- 1 February 2010
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 411 (7-9) , 1167-1181
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- A better bound for the cop number of general graphsJournal of Graph Theory, 2008
- Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short CyclesAlgorithmica, 2008
- Context-free handle-rewriting hypergraph grammars2005
- Which Problems Have Strongly Exponential Complexity?Journal of Computer and System Sciences, 2001
- Graph Searching on Some Subclasses of Chordal GraphsAlgorithmica, 2000
- The complexity of pursuit on a graphTheoretical Computer Science, 1995
- On a Pursuit Game on Cayley DigraphsEuropean Journal of Combinatorics, 1987
- Some Results about Pursuit Games on Metric Spaces Obtained Through Graph Theory TechniquesEuropean Journal of Combinatorics, 1986
- A game of cops and robbersDiscrete Applied Mathematics, 1984
- Some combinatorial game problems require Ω(
n
k
) timeJournal of the ACM, 1984