PublicationInformation Processing LettersPaperComplexity of finding k-path-free dominating sets in graphsInformation Processing LettersView publicationAbstractNo abstract available.Home↳ PublicationsDate23 Jul 1982PublicationInformation Processing LettersAuthorsReuven Bar-YehudaUzi VishkinIBM-affiliated at time of publicationTopicsComputer ScienceShare
