An Optimal Parallel Algorithm for the Domatic Partition Problem on an Interval Graph Given its Sorted Model

Ming-Shing Yu, Cheng-Hsing Yang. An Optimal Parallel Algorithm for the Domatic Partition Problem on an Interval Graph Given its Sorted Model. Inf. Process. Lett., 44(1):15-22, 1992.

@article{YuY92:0,
  title = {An Optimal Parallel Algorithm for the Domatic Partition Problem on an Interval Graph Given its Sorted Model},
  author = {Ming-Shing Yu and Cheng-Hsing Yang},
  year = {1992},
  tags = {graph-rewriting, rewriting, partitioning},
  researchr = {https://researchr.org/publication/YuY92%3A0},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {44},
  number = {1},
  pages = {15-22},
}