55 search results - page 3 / 11 » Pathwidth of Circular-Arc Graphs |
ENDM
2008
13 years 6 months ago
2008
SIAMDM
2008
13 years 6 months ago
2008
In a recent paper, Dur
APPROX
1998
Springer
13 years 10 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
JGT
2007
13 years 6 months ago
2007
: Let G be a 3-connected planar graph and G∗ be its dual. We show that the pathwidth of G∗ is at most 6 times the pathwidth of G. We prove this result by relating the pathwidth...
JGT
2007
13 years 6 months ago
2007
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved...