Sciweavers

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

6

JAL
2006

favoriteEmaildiscussreport

52views more JAL 2006»

Polynomial time recognition of unit circular-arc graphs

13 years 4 months ago

Polynomial time recognition of unit circular-arc graphs

Download www.cs.colostate.edu

Guillermo Durán, Agustín Gravano, Ro

Real-time Traffic

JAL 2006 |

claim paper

Related Content

» Unit CircularArc Graph Representations and Feasible Circulations

» Proper Helly CircularArc Graphs

» Characterizations and Linear Time Recognition of Helly CircularArc Graphs

» Pathwidth of CircularArc Graphs

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

» Kayles and Nimbers

» Register Allocation After Classical SSA Elimination is NPComplete

» Approximation Algorithms for the Maxcoloring Problem

» Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JAL
Authors	Guillermo Durán, Agustín Gravano, Ross M. McConnell, Jeremy Spinrad, Alan Tucker

Comments (0)