An O(m=n) Algorithm for Finding a Minimum Weight Dominating Set in Permutation Graphs

C. Rhee, Y. D. Liang, S. K. Dhall, S. Lakshmivarahan

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

Fingerprint

Dive into the research topics of 'An O(m=n) Algorithm for Finding a Minimum Weight Dominating Set in Permutation Graphs'. Together they form a unique fingerprint.

Mathematics