Sum Multicoloring of Graphs

DOI10.1006/JAGM.2000.1106MaRDI QIDQ4521523zbMATH OpenOpenAlexFDO

Authors Amotz Bar-Noy, Magnús M. Halldórsson, Ravit Salman, Guy Kortsarz, Hadas Shachnai

Publication date 19 December 2000

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/261cc0d6c1d6291c55f3bb8ece9bca10378cf0a0

zbMATH Keywords

graph multicoloring problemscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Approximation and Online Algorithms
• Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
• scientific article; zbMATH DE number 1833406
• Automata, Languages and Programming
• Multicoloring trees.

Cited in

(24)

• Weighted sum coloring in batch scheduling of conflicting jobs
• On chromatic sums and distributed resource allocation
• Multicoloring trees.
• Graph multi-coloring for a job scheduling application
• Non-clairvoyant scheduling with conflicts for unit-size jobs
• Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
• Multi-coloring and job-scheduling with assignment and incompatibility costs
• Minimum sum multicoloring on the edges of trees
• Sum edge coloring of multigraphs via configuration LP
• Min Sum Edge Coloring in Multigraphs Via Configuration LP
• Batch Coloring Flat Graphs and Thin
• Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees
• scientific article; zbMATH DE number 1833406 (Why is no real title available?)
• STACS 2004
• Mathematical Foundations of Computer Science 2004
• Approximation and Online Algorithms
• Automata, Languages and Programming
• Minimum sum set coloring of trees and line graphs of trees
• Concurrency constrained scheduling with tree-like constraints
• On sum coloring and sum multi-coloring for restricted families of graphs
• Scheduling with conflicts: Online and offline algorithms
• Time slot scheduling of compatible jobs
• Dynamic programming based algorithms for set multicover and multiset multicover problems
• Coloring the Cartesian sum of graphs

This page was built for publication: Sum Multicoloring of Graphs

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