Pathwidth

Known as: Path Decomposition, Path-width, Width (disambiguation) 
In graph theory, a path decomposition of a graph G is, informally, a representation of G as a "thickened" path graph, and the pathwidth of G is a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We consider the problem of sampling a proper k-coloring of a graph of maximal degree ∆ uniformly at random. We describe a new… (More)
  • table 1
Is this relevant?
2012
2012
It is proven that the connected pathwidth of any graph G is at most 2 · pw(G) + 1, where pw(G) is the pathwidth of G. The method… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2011
2011
For each non-negative integer k, we provide all outerplanar obstructions for the class of graphs whose cycle matroid has… (More)
  • figure 1
  • figure 3
  • figure 5
Is this relevant?
2008
2008
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code… (More)
  • figure 2.1
  • figure 3.1
  • figure 3.2
  • figure 4.1
  • figure 4.2
Is this relevant?
2007
2007
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth… (More)
  • figure 2
Is this relevant?
2006
2006
We prove that for any ε > 0 there exists an integer nε such that the pathwidth of every cubic graph on n > nε vertices is at most… (More)
Is this relevant?
2005
2005
We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In this paper we give, for all constants k, l, explicit algorithms, that given a graph G = (V, E) with a tree-decomposition of G… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In this paper, we give for constant k a linear-time algorithm that, given a graph G (V, E), determines whether the treewidth of G… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Various parameters of graphs connected to sparse matrix factoriza-tion and other applications can be approximated using an… (More)
Is this relevant?