91 search results - page 2 / 19 » Pathwidth of outerplanar graphs |
CPC
2006
13 years 5 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
WALCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
IEICET
2011
13 years 5 days ago
2011
In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two differ...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
It is proven that the connected pathwidth of any graph G is at most 2
WG
2007
Springer
13 years 11 months ago
2007
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...