Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs

6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given a graph G=(V, E) with real weights assigned to its vertices, a clique of G that also dominates its vertex set V, is called a dominating clique (DC) of G. Given a permutation graph G with all its vertices having nonnegative weights, and its permutation representation, the problem addressed in this paper is that of finding any minimum weight DC of G. We improve the existing O(|V|2) algorithm for this problem to O(|V|log|V|). The space complexity of our algorithm is O(|V|). We also present a |V| processor, O(log|V|) time, O(|V|log|V|) space parallel EREW PRAM algorithm for this problem. © 1991.

Cite

CITATION STYLE

APA

Srinivasan, A., & Pandu Rangan, C. (1991). Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs. Theoretical Computer Science, 91(1), 1–21. https://doi.org/10.1016/0304-3975(91)90265-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free