Parallel and On-Line Graph Coloring

DOI10.1006/JAGM.1996.0836zbMATH Open0873.68165OpenAlexW2022525153MaRDI QIDQ4339004FDOQ4339004

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

Recommendations

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

zbMATH Keywords

graph coloring

Mathematics Subject Classification ID

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

Cited In (12)

• A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
• On the online track assignment problem
• Title not available (Why is that?)
• Dynamic graph coloring
• Title not available (Why is that?)
• Online coloring of short intervals
• Tight bounds for online coloring of basic graph classes
• Tight bounds for online coloring of basic graph classes
• Title not available (Why is that?)
• A better performance guarantee for approximate graph coloring
• Competitive vertex recoloring. (Online disengagement)
• Online coloring of hypergraphs

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)