Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

WG
2007
Springer

favoriteEmaildiscussreport

100views Theoretical Computer Science» more WG 2007»

Pathwidth of Circular-Arc Graphs

14 years 5 months ago

Pathwidth of Circular-Arc Graphs

Download www.univ-orleans.fr

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, there are extremely few graph classes for which pathwidh is known to be tractable in polynomial time. We give in this paper an O(n2 )-time algorithm computing the pathwidth of circular-arc graphs.

Karol Suchan, Ioan Todinca

Real-time Traffic

Computer Science | Graph Classes | Minimum Clique Number | Well-studied Graph Parameter | WG 2007 |

claim paper

Related Content

» Drawing Planar Graphs with Circular Arcs

» Proper Helly CircularArc Graphs

» Scheduling of a Smart Antenna Capacitated Coloring of Unit CircularArc Graphs

» Simultaneous Graph Embedding with Bends and Circular Arcs

» A note on the Hadwiger number of circular arc graphs

» Characterizations and Linear Time Recognition of Helly CircularArc Graphs

» Efficient Algorithms for the Domination Problems on Interval and CircularArc Graphs

» Efficient Algorithms for Centers and Medians in Interval and CircularArc Graphs

» FixedLocation CircularArc Drawing of Planar Graphs

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	WG
Authors	Karol Suchan, Ioan Todinca

Comments (0)