Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph

Mahnhoon Lee, Sridhar Radhakrishnan. Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph. Discrete Applied Mathematics, 152(1-3):266-272, 2005. [doi]

@article{LeeR05:2,
  title = {Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph},
  author = {Mahnhoon Lee and Sridhar Radhakrishnan},
  year = {2005},
  doi = {10.1016/j.dam.2005.03.010},
  url = {http://dx.doi.org/10.1016/j.dam.2005.03.010},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/LeeR05%3A2},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {152},
  number = {1-3},
  pages = {266-272},
}