A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set

Jens Gustedt, Jan Arne Telle. A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set. In Carlo Blundo, Cosimo Laneve, editors, Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings. Volume 2841 of Lecture Notes in Computer Science, pages 125-136, Springer, 2003. [doi]

@inproceedings{GustedtT03,
  title = {A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set},
  author = {Jens Gustedt and Jan Arne Telle},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2841&spage=125},
  researchr = {https://researchr.org/publication/GustedtT03},
  cites = {0},
  citedby = {0},
  pages = {125-136},
  booktitle = {Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings},
  editor = {Carlo Blundo and Cosimo Laneve},
  volume = {2841},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-20216-1},
}