Results 1  10
of
184,550
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
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
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
in general, can be efficiently solved on graphs of bounded treewidth. For directed graphs, there are several similar measures, among others entanglement, directed treewidth, DAGwidth and Kellywidth, that have shown their advantages as well as disadvantages. In this thesis, we work on complexity measures
Forbidden Directed Minors and Kellywidth
, 2014
"... Partial 1trees are undirected graphs of treewidth at most one. Similarly, partial 1DAGs are directed graphs of KellyWidth at most two. It is wellknown that an undirected graph is a partial 1tree if and only if it has no K3 minor. In this paper, we generalize this characterization to partial 1DA ..."
Abstract
 Add to MetaCart
Partial 1trees are undirected graphs of treewidth at most one. Similarly, partial 1DAGs are directed graphs of KellyWidth at most two. It is wellknown that an undirected graph is a partial 1tree if and only if it has no K3 minor. In this paper, we generalize this characterization to partial 1
Directed by
"... Motion capture is an important application in diverse areas such as biomechanics, computer animation, and humancomputer interaction. Current motion capture methods use markers that are attached to the body of the subject and are therefore intrusive. In applications such as pathological human movem ..."
Abstract
 Add to MetaCart
Motion capture is an important application in diverse areas such as biomechanics, computer animation, and humancomputer interaction. Current motion capture methods use markers that are attached to the body of the subject and are therefore intrusive. In applications such as pathological human movement analysis, these markers may introduce unknown artifacts in the motion and are, in general, cumbersome. We present a computer vision based system for markerless human motion capture that uses images obtained from multiple synchronized and calibrated cameras. We model the human body as a set of rigid segments connected in articulated chains. We use a volumetric representation (voxels) of the subject using images obtained from the cameras in our work. We propose a novel, bottomup approach to segment the voxels into different articulated chains based on their mutual connectivity, by mapping the voxels into Laplacian Eigenspace. We prove properties of the mapping that show that it is ideal for mapping voxels
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
Directed Graphs of Entanglement Two
"... Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µcalculus is strict. While graphs of entanglement zero and one are indeed very simple, some graphs of entanglement two already contain interesting nesting of cycles ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µcalculus is strict. While graphs of entanglement zero and one are indeed very simple, some graphs of entanglement two already contain interesting nesting
Results 1  10
of
184,550