Balanced Paths in Colored Graphs

DOI10.1007/978-3-642-03816-7_14MaRDI QIDQ3182921zbMATH OpenOpenAlexFDO

Authors Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano

Publication date 16 October 2009

Published in Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03816-7_14

zbMATH Keywords

coarse-grained modeledge labelingfair pathinfinite pathlinear programscheduling applicationssolvable in linear time

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05)

Recommendations

• Quantitatively fair scheduling
• scientific article; zbMATH DE number 2147947
• Quantitative fairness games
• Color-coding algorithms to the balanced path problem: computational issues
• Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms

Cites work

• Bounded fairness
• scientific article; zbMATH DE number 3735115 (Why is no real title available?)
• scientific article; zbMATH DE number 52331 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1324655 (Why is no real title available?)
• Introduction to algorithms
• On Context-Free Languages

Cited in

(4)

• The structural complexity landscape of finding balance-fair shortest paths
• Color-coding algorithms to the balanced path problem: computational issues
• Quantitative fairness games
• Quantitatively fair scheduling

This page was built for publication: Balanced Paths in Colored Graphs

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