Optimal edge-coloring with edge rate constraints

DOI10.1002/NET.21505zbMATH Open1338.05079OpenAlexW2075240586MaRDI QIDQ2811307FDOQ2811307

Yori Zwols, Dariusz Dereniowski, Bernard Ries, Wieslaw 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

scheduling algorithmswireless networksedge coloringthroughput maximizationfractional edge coloringreedy maximal schedulingnearly bipartite graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

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

Cited In (3)

• Fast edge colorings with fixed number of colors to minimize imbalance
• Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance
• Optimal edge coloring of large graphs

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

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