Sciweavers

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

7

ANOR
2008

favoriteEmaildiscussreport

61views more ANOR 2008»

Algorithms for finding clique-transversals of graphs

13 years 4 months ago

Algorithms for finding clique-transversals of graphs

Download mate.dm.uba.ar

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

Real-time Traffic

ANOR 2008 |

claim paper

Related Content

» A Polynomial Time Algorithm for Finding Nash Equilibria in Planar WinLose Games

» Fast algorithms for finding matchings in lopsided bipartite graphs with applications to di...

» Efficient algorithms for finding critical subgraphs

» A Linear Algorithm for Finding the Invariant Edges of an EdgeWeighted Graph

» A New Algorithm for Finding Minimal CycleBreaking Sets of Turns in a Graph

» Algorithms for Finding DistanceEdgeColorings of Graphs

» A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs

» Approximation algorithms for finding and partitioning unitdisk graphs into cokplexes

» A 53Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs

» Finding Sparser Directed Spanners

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2008
Where	ANOR
Authors	Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter

Comments (0)