An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph

Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan. An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph. SIAM Journal on Computing, 25(2):404-419, 1996.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.