Sciweavers

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

18

ALGORITHMICA
2010

favoriteEmaildiscussreport

82views more ALGORITHMICA 2010»

Fractional Path Coloring in Bounded Degree Trees with Applications

13 years 11 months ago

Fractional Path Coloring in Bounded Degree Trees with Applications

Download www-sop.inria.fr

Ioannis Caragiannis, Afonso Ferreira, Christos Kak

Real-time Traffic

ALGORITHMICA 2010 |

claim paper

Related Content

» Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree

» Tight Bounds for Wavelength Assignment on Trees of Rings

» The Power of Orientation in SymmetryBreaking

» Efficient Construction of a Bounded Degree Spanner with Low Weight

» Testing Convexity Properties of Tree Colorings

» Sharp Separation and Applications to Exact and Parameterized Algorithms

» Hardness and Algorithms for Rainbow Connectivity

» Iterative Methods in Combinatorial Optimization

» Counting Subgraphs via Homomorphisms

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2010
Where	ALGORITHMICA
Authors	Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Hervé Rivano

Comments (0)