55 search results - page 4 / 11 » Pathwidth of Circular-Arc Graphs |
WALCOM
2010
IEEE
13 years 5 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 ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We introduce the notion of Lombardi graph drawings, named after the abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line seg...
WG
2001
Springer
13 years 11 months ago
2001
Springer
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...
CCCG
2007
13 years 8 months ago
2007
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
DAM
2011
13 years 1 months ago
2011
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...