scientific article; zbMATH DE number 2230222
From MaRDI portal
Publication:5708510
zbMath1075.90523MaRDI QIDQ5708510
Javier Marenco, Annegret K. Wagler
Publication date: 18 November 2005
Full work available at URL: http://www.sciencedirect.com/science/journal/15710653
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Chromatic scheduling and frequency assignment
- Interval vertex-coloring of a graph with forbidden colors
- Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
- Consecutive colorings of graphs
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
This page was built for publication: