Topics in computational complexity
<p>This thesis concerns the computational complexity of several combinatorial problems.</p><p>Chapter 1 is notation and definitions. In Chapter 2 the subgraph homeomorphism problem, for fixed pattern graphs H, is considered. For the cases H and#x2245; C<sub>6</sub>,C<...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
1986
|
| Subjects: |