Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Chiou-Kuo Liang. An ::::O(n:::::::2:::) Algorithm for Finding the Compact Sets of a Graph. BIT, 33(3):390-395, 1993.
Possibly Related PublicationsThe following publications are possibly variants of this publication: An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation GraphChong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan. SICOMP, 25(2):404-419, 1996.
The following publications are possibly variants of this publication: