Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

Leonid Barenboim, Michael Elkin. Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. Distributed Computing, 22(5-6):363-379, 2010. [doi]

@article{BarenboimE10,
  title = {Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition},
  author = {Leonid Barenboim and Michael Elkin},
  year = {2010},
  doi = {10.1007/s00446-009-0088-2},
  url = {http://dx.doi.org/10.1007/s00446-009-0088-2},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BarenboimE10},
  cites = {0},
  citedby = {0},
  journal = {Distributed Computing},
  volume = {22},
  number = {5-6},
  pages = {363-379},
}