The final Chapter concerns a problem of partitioning graphs subject to certain restrictions. We prove that several subproblems are NP-complete.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:371525 |
| Date | January 1986 |
| Creators | Farr, Graham E. |
| Contributors | Welsh, D. J. A. |
| Publisher | University of Oxford |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | http://ora.ox.ac.uk/objects/uuid:ad3ed1a4-fea4-4b46-8e7a-a0c6a3451325 |
Page generated in 0.0017 seconds