Online Bounded Coloring of Permutation and Overlap Graphs

DOI10.1016/j.endm.2008.01.037zbMath1341.05069OpenAlexW2026881717MaRDI QIDQ3503553

Gabriele Di Stefano, Benjamin Leroy-Beaulieu, Marc Demange

Publication date: 5 June 2008

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

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

zbMATH Keywords

competitive analysisonline algorithmsbounded coloringpermutation graphsoverlap graphsFirst-Fit

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Unnamed Item

Cites Work

• On the performance of the first-fit coloring algorithm on permutation graphs
• Track assignment
• Algorithms for a maximum clique and a maximum independent set of a circle graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Online Bounded Coloring of Permutation and Overlap Graphs