Distributed Algorithms for Coloring Interval Graphs

DOI10.1007/978-3-662-45174-8_31zbMath1437.68196OpenAlexW2136749024MaRDI QIDQ5498703

Christian Konrad, Magnús M. Halldórsson

Publication date: 10 February 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-45174-8_31

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62) Distributed algorithms (68W15)

Related Items (5)

Distributed minimum vertex coloring and maximum independent set in chordal graphs ⋮ Computing large independent sets in a single round ⋮ Limitations of current wireless link scheduling algorithms ⋮ Improved distributed algorithms for coloring interval graphs with application to multicoloring trees ⋮ Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs

This page was built for publication: Distributed Algorithms for Coloring Interval Graphs