scientific article; zbMATH DE number 1182769

MaRDI QIDQ4400852zbMATH OpenFDO

Authors

Publication date 10 December 1998

zbMATH Keywords

bandwidth allocationcircular arc graph colouring problem

Mathematics Subject Classification ID

Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)

Recommendations

• An approximation algorithm for circular arc colouring
• STACS 2004
• Wavelength allocation on trees of rings
• Routing and path multicoloring

Cited in

(13)

• An approximation algorithm for circular arc colouring
• Randomized path coloring on binary trees.
• Revisiting Tucker's algorithm to color circular-arc graphs
• On packing and coloring hyperedges in a cycle
• The complexity of path coloring and call scheduling
• Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
• On the computational complexity of strong edge coloring
• Path problems in generalized stars, complete graphs, and brick wall graphs
• Fractional path coloring in bounded degree trees with applications
• Nash equilibria in all-optical networks
• Minimizing maximum fiber requirement in optical networks
• Line system design and a generalized coloring problem
• Interval scheduling: A survey

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400852)