Complexity of Finding k-Path-Free Dominating Sets in Graphs

Reuven Bar-Yehuda, Uzi Vishkin. Complexity of Finding k-Path-Free Dominating Sets in Graphs. Inf. Process. Lett., 14(5):228-232, 1982.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.