All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”
EN
ČeštinaEnglish

Filters

60 (0,078s) •

Result

Complexity of the cop and robber guarding game

in a (directed or undirected) graph against a robber. The robber and the cops are placed), cops inside the guarded region, the robber on the remaining vertices (the robber-region). The goal of the robber ...

IN - Informatika

  • 2011
    • •
  • Jx
    • •
  • Link
Result

Cops, a fast robber and defensive domination on interval graphs

The game of Cops and oo-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any ...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2019
    • •
  • Jimp
    • •
  • Link
Result

The guarding game is E-complete

in a (directed or undirected) graph against Robber. Robber and the cops are placed), cops inside the guarded region, Robber on the remaining vertices (the robber-region). The goal of Robber is to enter th...

IN - Informatika

  • 2014
    • •
  • Jx
    • •
  • Link
Result

Cop-Win Graphs with Maximum Capture-Time

We present an upper bound n?4 for the maximum length of a cop and robber game (the capture-time) on a cop-win graph of order n. This bound matches the known lower bound and describe an inductive construction of the entire class. A cop and

BA - Obecná matematika

  • 2010
    • •
  • Jx
Result

On tractability of Cops and Robbers game

In this paper we prove that computing the minimum number of cops that can catch a robber in a given graph is NP-hard. Also we show that the parameterized version of the problem is W[2]-hard....

BA - Obecná matematika

  • 2008
    • •
  • D
Result

Catching a Fast Robber on Interval Graphs

We analyse the Cops and oo-fast Robber game on the class of interval graphs posed in paper "Pursuing a fast robber on a graph" by Fomin et al. [4] The game by two players, one controlling k cops, the other a robber. The pla...

IN - Informatika

  • 2011
    • •
  • Jx
    • •
  • Link
Result

Cops-and-robbers: Remarks and problems

We explore cops-and-robbers games in several directions, giving partial results in each and refuting two reasonable conjectures. We close with some open problems....

IN - Informatika

  • 2013
    • •
  • Jx
Result

Pursuing a fast robber on a graph

The Cops and Robbers game as originally defined independently by Quilliot the minimum number of cops that are guaranteed to catch a robber on a given graph is NP extends to the case where the robber moves s time faster than...

BD - Teorie informace

  • 2010
    • •
  • Jx
Result

Cops and Robbers on Intersection Graphs

The game of cops and robber, introduced by Nowakowski and Winkler in 1983, is played by two players on a graph G, one controlling k cops and the other one robber, all positioned on V G . The players alternate in moving their pieces ...

BA - Obecná matematika

  • 2013
    • •
  • D
    • •
  • Link
Result

Cops and Robbers on String Graphs

The game of cops and robber, introduced by Nowakowski and Winkler in 1983, is played by two players on a graph. One controls k cops and the other a robber. The players alternate and move their pieces to the distance at most one. The...

IN - Informatika

  • 2015
    • •
  • D
    • •
  • Link
  • 1 - 10 out of 60