Sciweavers

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

7

DAM
2006

favoriteEmaildiscussreport

71views more DAM 2006»

Algorithms for clique-independent sets on subclasses of circular-arc graphs

13 years 4 months ago

Algorithms for clique-independent sets on subclasses of circular-arc graphs

Download www.glyc.dc.uba.ar

Guillermo Durán, Min Chih Lin, Sergio Mera,

Real-time Traffic

DAM 2006 |

claim paper

Related Content

» Proper Helly CircularArc Graphs

» FixedLocation CircularArc Drawing of Planar Graphs

» Characterizations and Linear Time Recognition of Helly CircularArc Graphs

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

» Approximation Algorithms for the Maxcoloring Problem

» A lineartime algorithm for optimal barrier placement

» On a discretizable subclass of instances of the molecular distance geometry problem

» Partial characterizations of cliqueperfect graphs I Subclasses of clawfree graphs

» Approximation Algorithms for Dominating Set in Disk Graphs

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	DAM
Authors	Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter

Comments (0)