55 search results - page 3 / 11 » Pathwidth of Circular-Arc Graphs |
ENDM
2008
15 years 1 months ago
2008
67
Voted
SIAMDM
2008
15 years 1 months ago
2008
In a recent paper, Dur
111
click to vote
APPROX
1998
Springer
15 years 5 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...
120
click to vote
JGT
2007
15 years 1 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
15 years 1 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...