Fractional Path Coloring in Bounded Degree Trees with Applications

descriptionPublicationkeyboard_double_arrow_right Article 14 Feb 2009 France English Publisher:Springer Science and Business Media LLCJournal:Algorithmica, volume 58, pages 516-540 (issn: 0178-4617, eissn: 1432-0541,

Copyright policy )

Authors: Ioannis Caragiannis; Afonso Ferreira; Christos Kaklamanis; Stéphane Pérennes; Hervé Rivano;

doi: 10.1007/s00453-009-9278-3

Fractional Path Coloring in Bounded Degree Trees with Applications

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Country

France

Related Organizations

Keywords

[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], optical networks, fixed parameter tractable problem, Approximation algorithms, Coloring of graphs and hypergraphs, Linear programming, fractional coloring, linear relaxation, path coloring, approximation algorithms, Paths and cycles, wavelength division multiplexing

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average