55 search results - page 5 / 11 » Pathwidth of Circular-Arc Graphs |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
It is proven that the connected pathwidth of any graph G is at most 2
CORR
2007
Springer
13 years 6 months ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
JAL
2002
13 years 6 months ago
2002
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
FAW
2009
Springer
14 years 1 months ago
2009
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for parti...
ICCV
2007
IEEE
14 years 8 months ago
2007
IEEE
We propose a novel generative language for shape that is based on the shock graph: given a shock graph topology, we explore constraints on the geometry and dynamics of the shock g...