A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph

B. S. Panda, D. Pradhan. A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph. Discrete Applied Mathematics, 161(12):1776-1783, 2013. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.