- Opin vísindi
- →
- Browsing by DOI
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing by DOI "https://doi.org/10.1016/j.tcs.2018.11.028"
Now showing items 1-1 of 1
-
Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Elsevier BV, 2020-04)We give a distributed (1+eps)-approximation algorithm for the minimum vertex coloring problem on interval graphs, which runs in the LOCAL model and operates in O((1/eps) log* n) rounds. If nodes are aware of their interval representations, then the ...
Now showing items 1-1 of 1