Parallel and On-Line Graph Coloring

DOI10.1006/JAGM.1996.0836MaRDI QIDQ4339004zbMATH OpenOpenAlexFDO

Authors Magnús M. Halldórsson

Publication date 23 June 1997

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

Full work available at URL https://doi.org/10.1006/jagm.1996.0836

zbMATH Keywords

graph coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Randomized online graph coloring
• scientific article; zbMATH DE number 219240
• scientific article; zbMATH DE number 17674

Cited in

(14)

• Tight bounds for online coloring of basic graph classes
• A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
• On the online track assignment problem
• scientific article; zbMATH DE number 1303205 (Why is no real title available?)
• scientific article; zbMATH DE number 219240 (Why is no real title available?)
• Tight bounds for online coloring of basic graph classes
• Dynamic graph coloring
• scientific article; zbMATH DE number 7758354 (Why is no real title available?)
• Competitive vertex recoloring. (Online disengagement)
• Online coloring of short intervals
• Online coloring of hypergraphs
• On the on-line coloring of unit interval graphs with proper interval representation
• First-fit coloring of forests in random arrival model
• A better performance guarantee for approximate graph coloring

This page was built for publication: Parallel and On-Line Graph Coloring

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