scientific article; zbMATH DE number 1182769
From MaRDI portal
Publication:4400852
zbMath0902.68145MaRDI QIDQ4400852
No author found.
Publication date: 10 December 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)
Related Items (11)
On packing and coloring hyperedges in a cycle ⋮ Unnamed Item ⋮ Interval scheduling: A survey ⋮ Path problems in generalized stars, complete graphs, and brick wall graphs ⋮ The complexity of path coloring and call scheduling ⋮ Fractional path coloring in bounded degree trees with applications ⋮ Nash equilibria in all-optical networks ⋮ Randomized path coloring on binary trees. ⋮ Minimizing maximum fiber requirement in optical networks ⋮ On the computational complexity of strong edge coloring ⋮ Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
This page was built for publication:
