A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs

B. S. Panda, Sajal K. Das. A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs. Inf. Process. Lett., 109(18):1041-1046, 2009. [doi]

@article{PandaD09,
  title = {A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs},
  author = {B. S. Panda and Sajal K. Das},
  year = {2009},
  doi = {10.1016/j.ipl.2009.06.011},
  url = {http://dx.doi.org/10.1016/j.ipl.2009.06.011},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/PandaD09},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {109},
  number = {18},
  pages = {1041-1046},
}