Coloring Graphs with Minimal Edge Load

DOI10.1016/J.ENDM.2004.03.005MaRDI QIDQ3439119zbMATH OpenOpenAlexFDO

Authors Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2004.03.005

zbMATH Keywords

graph coloringgraph partitioning

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Approximation and Online Algorithms
• On the minimum load coloring problem
• Parameterized algorithms for load coloring problem
• Parameterized and approximation algorithms for the load coloring problem
• Load balancing by graph coloring, an algorithm

Cites work

• Approximation and Online Algorithms
• Fast Approximate Graph Partitioning Algorithms
• scientific article; zbMATH DE number 1246230 (Why is no real title available?)
• scientific article; zbMATH DE number 1354122 (Why is no real title available?)
• scientific article; zbMATH DE number 1929926 (Why is no real title available?)
• Weighted sums of certain dependent random variables

Cited in

(12)

• Load balancing by graph coloring, an algorithm
• Parsimonious edge coloring
• Minimum number of palettes in edge colorings
• Parameterized and approximation algorithms for the load coloring problem
• On the minimum load coloring problem
• Coloring k-colorable graphs using smaller palettes
• Graphs with least number of colorings
• Fast edge colorings with fixed number of colors to minimize imbalance
• Parameterized and approximation algorithms for the load coloring problem
• Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance
• Approximation and Online Algorithms
• Coloring a graph optimally with two colors

This page was built for publication: Coloring Graphs with Minimal Edge Load

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