The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
Author:
Open Access
- 1 October 1979
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 26 (4) , 618-630
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- The complexity of restricted minimum spanning tree problemsLecture Notes in Computer Science, 1979
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Testing graph connectivity1974
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Reducibility among Combinatorial Problems1972
- GRAPH THEORY1969