Results 1  10
of
42,396
Graph Searching Games and Width Measures for Directed Graphs
"... In cops and robber games a number of cops tries to capture a robber in a graph. A variant of these games on undirected graphs characterises tree width by the least number of cops needed to win. We consider cops and robber games on digraphs and width measures (such as DAGwidth, directed tree width o ..."
Abstract
 Add to MetaCart
In cops and robber games a number of cops tries to capture a robber in a graph. A variant of these games on undirected graphs characterises tree width by the least number of cops needed to win. We consider cops and robber games on digraphs and width measures (such as DAGwidth, directed tree width
The DAGWidth of Directed Graphs
, 2009
"... Treewidth is a wellknown metric on undirected graphs that measures how treelike a graph is and gives a notion of graph decomposition that proves useful in algorithm development. Treewidth can be characterised by a graph searching game where a number of cops attempt to capture a robber. We consid ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
Treewidth is a wellknown metric on undirected graphs that measures how treelike a graph is and gives a notion of graph decomposition that proves useful in algorithm development. Treewidth can be characterised by a graph searching game where a number of cops attempt to capture a robber. We
New Width Parameters of Graphs
, 2012
"... The main focus of this thesis is on using the divide and conquer technique to efficiently solve graph problems that are in general intractable. We work in the field of parameterized algorithms, using width parameters of graphs that indicate the complexity inherent in the structure of the input graph ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
The main focus of this thesis is on using the divide and conquer technique to efficiently solve graph problems that are in general intractable. We work in the field of parameterized algorithms, using width parameters of graphs that indicate the complexity inherent in the structure of the input
DAGwidth and parity games
 IN PROCEEDINGS OF THE 23RD ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS
, 2006
"... Treewidth is a wellknown metric on undirected graphs that measures how treelike a graph is and gives a notion of graph decomposition that proves useful in algorithm development. Treewidth is characterised by a game known as the copsandrobber game where a number of cops chase a robber on the gr ..."
Abstract

Cited by 57 (9 self)
 Add to MetaCart
to be useful in developing algorithms on directed graphs. In particular, we show that the problem of determining the winner of a parity game is solvable in polynomial time on graphs of bounded DAGwidth. We also consider the relationship between DAGwidth and other measures of such as entanglement and directed
Entanglement and the Complexity of Directed Graphs
, 2012
"... Entanglement is a parameter for the complexity of finite directed graphs that measures to which extent the cycles of the graph are intertwined. It is defined by way of a game similar in spirit to the cops and robber games used to describe tree width, directed tree width, and hypertree width. Neverth ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Entanglement is a parameter for the complexity of finite directed graphs that measures to which extent the cycles of the graph are intertwined. It is defined by way of a game similar in spirit to the cops and robber games used to describe tree width, directed tree width, and hypertree width
Entanglement and the Complexity of Directed Graphs
, 2011
"... Entanglement is a parameter for the complexity of finite directed graphs that measures to which extent the cycles of the graph are intertwined. It is defined by way of a game similar in spirit to the cops and robber games used to describe tree width, directed tree width, and hypertree width. Neverth ..."
Abstract
 Add to MetaCart
Entanglement is a parameter for the complexity of finite directed graphs that measures to which extent the cycles of the graph are intertwined. It is defined by way of a game similar in spirit to the cops and robber games used to describe tree width, directed tree width, and hypertree width
Computational Experiments on Graph Width Metrics
, 2003
"... Abstract Many reallife problems can be modelled using graphs. However, the solutions to these problems are often N Pcomplete. In 1986, Robertson and Seymour introduced the notion of a treedecomposition of a graph, with an associated width called the treewidth, as a formal characterisation of how ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract Many reallife problems can be modelled using graphs. However, the solutions to these problems are often N Pcomplete. In 1986, Robertson and Seymour introduced the notion of a treedecomposition of a graph, with an associated width called the treewidth, as a formal characterisation of how
Graph Searching, Parity Games and Imperfect Information
"... We investigate the interrelation between graph searching games and games with imperfect information. As key consequence we obtain that parity games with bounded imperfect information can be solved in Ptime on graphs of bounded DAGwidth which generalizes several results for parity games on graphs o ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We investigate the interrelation between graph searching games and games with imperfect information. As key consequence we obtain that parity games with bounded imperfect information can be solved in Ptime on graphs of bounded DAGwidth which generalizes several results for parity games on graphs
Graph Complexity Measures and Monotonicity
, 2012
"... The structural complexity of instances of computational problems has been an important research area in theoretical computer science in the last decades. Its success manifested itself in treewidth—a complexity measure for undirected graphs. Many practically relevant problems that are difficult in g ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
for directed graphs that can be described in terms of graph searching games. A graph searching game is played on a given graph by a team of cops and a robber. The cops try to capture the robber whose intent is to escape. Precise rules define a game and a complexity measure on graphs. The complexity of a graph
Results 1  10
of
42,396