@inproceedings{b121b6363b66468aaf8caaf62ca4580d,
title = "NC algorithms for dominations in permutation graphs",
abstract = "In this paper, we present NC algorithms for finding minimum weight independent dominating set (MWIDS), minimum weight total dominating set (MWTDS), and minimum weight connected dominating set (MWCDS) for permutation graphs. All these algorithms take O(log 2n) time on CREW PRAM. The number of processor required is n3/logn for finding MWIDS, and m3/logm for finding MWTDS and MWCDS, where m is the number of edges in a permutation graph of n nodes.",
author = "Liang, {Y. D.} and C. Rhee and Dhall, {S. K.} and S. Lakshmivarahan",
year = "1992",
doi = "10.1145/130069.130084",
language = "English",
isbn = "089791502X",
series = "Applied Computing: Technological Challenges of the 1990's",
publisher = "Publ by ACM",
pages = "734--739",
booktitle = "Applied Computing",
note = "Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing - SAC '92 ; Conference date: 01-03-1992 Through 03-03-1992",
}