Return to search

Topics in computational complexity

The final Chapter concerns a problem of partitioning graphs subject to certain restrictions. We prove that several subproblems are NP-complete.

Identiferoai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:371525
Date January 1986
CreatorsFarr, Graham E.
ContributorsWelsh, D. J. A.
PublisherUniversity of Oxford
Source SetsEthos UK
Detected LanguageEnglish
TypeElectronic Thesis or Dissertation
Sourcehttp://ora.ox.ac.uk/objects/uuid:ad3ed1a4-fea4-4b46-8e7a-a0c6a3451325

Page generated in 0.0017 seconds