Improved distributed algorithms for coloring interval graphs with application to multicoloring trees

DOI10.1007/978-3-319-72050-0_15zbMath1437.68197OpenAlexW3119528091MaRDI QIDQ5916002

Magnús M. Halldórsson, Christian Konrad

Publication date: 12 April 2018

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/20.500.11815/2034

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 (2)

Distributed minimum vertex coloring and maximum independent set in chordal graphs ⋮ Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs

This page was built for publication: Improved distributed algorithms for coloring interval graphs with application to multicoloring trees