Sciweavers

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

10

STACS
2009
Springer

favoriteEmaildiscussreport

143views Theoretical Computer Science» more STACS 2009»

Computing Graph Roots Without Short Cycles

13 years 11 months ago

Computing Graph Roots Without Short Cycles

Download www.informatik.uni-rostock.de

Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngo

Real-time Traffic

STACS 2009 | Theoretical Computer Science |

claim paper

Related Content

» Choosability of toroidal graphs without short cycles

» Directed Graphs Without Short Cycles

» Approximating Maximum Subgraphs without Short Cycles

» Cycle Cover with Short Cycles

» Enumerating Rooted Graphs with Reflectional Block Structures

» Stochastic Steiner Trees Without a Root

» Minimum number of wavelengths equals load in a DAG without internal cycle

» On randomized representations of graphs using short labels

» Lower bounds for graph embeddings and combinatorial preconditioners

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	STACS
Authors	Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy

Comments (0)