Optimal edge-coloring with edge rate constraints

DOI10.1002/net.21505zbMath1338.05079OpenAlexW2075240586MaRDI QIDQ2811307

Yori Zwols, Dariusz Dereniowski, Bernard Ries, Wiesław X. Kubiak

Publication date: 10 June 2016

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21505

zbMATH Keywords

edge coloringwireless networksscheduling algorithmsthroughput maximizationfractional edge coloringreedy maximal schedulingnearly bipartite graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The chromatic index of nearly bipartite multigraphs
• The ellipsoid method and its consequences in combinatorial optimization
• The chromatic index of multigraphs of order at most 10
• Algorithmic graph theory and perfect graphs
• Link scheduling in polynomial time
• The NP-Completeness of Edge-Coloring
• Odd Minimum Cut-Sets and b-Matchings
• Open Shop Scheduling to Minimize Finish Time
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits
• Maximum matching and a polyhedron with 0,1-vertices
• Algorithms - ESA 2003

This page was built for publication: Optimal edge-coloring with edge rate constraints