Finding a maximum clique in an arbitrary graph
SIAM Journal on Computing
An application of duality to edge-deletion problems
SIAM Journal on Computing
Discrete Applied Mathematics
NC Algorithms for Recognizing Chordal Graphs and k Trees
IEEE Transactions on Computers
The complexity of regular subgraph recognition
Discrete Applied Mathematics - Computational combinatiorics
On the SPANNING k-TREE problem
Discrete Applied Mathematics
On spanning 2-trees in a graph
Discrete Applied Mathematics
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Graph classes: a survey
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
Journal of the ACM (JACM)
Edge-deletion and edge-contraction problems
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Network design problems: steiner trees and spanning k -trees
Network design problems: steiner trees and spanning k -trees
Additive Approximation for Edge-Deletion Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
An independent set approach for the communication network of the GPS III system
Discrete Applied Mathematics
| Hi-index | 0.04 |
We study the complexity of the problem of deciding the existence of a spanning subgraph of a given graph, and of that of finding a maximum (weight) such subgraph. We establish some general relations between these problems, and we use these relations to obtain new NP-completeness results for maximum (weight) spanning subgraph problems from analogous results for existence problems and from results in extremal graph theory. On the positive side, we provide a decomposition method for the maximum (weight) spanning chordal subgraph problem that can be used, e.g., to obtain a linear (or O(nlogn)) time algorithm for such problems in graphs with vertex degree bounded by 3.