On generating all maximal independent sets
Information Processing Letters
Enumeration of acyclic walks in a graph
Discrete Applied Mathematics
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Algorithms for Enumerating All Spanning Trees ofUndirected and Weighted Graphs
SIAM Journal on Computing
Journal of Algorithms
Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Integrating information by outerjoins and full disjunctions (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A unified approximation algorithm for node-deletion problems
Discrete Applied Mathematics
Approximating clique and biclique problems
Journal of Algorithms
Queries with incomplete answers over semistructured data
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The speed of hereditary properties of graphs
Journal of Combinatorial Theory Series B
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Generating Relations from XML Documents
ICDT '03 Proceedings of the 9th International Conference on Database Theory
The Approximation of Maximum Subgraph Problems
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On the complexity of the Maximum Subgraph Problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A new approach for approximating node deletion problems
Information Processing Letters
Additive Approximation for Edge-Deletion Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Full disjunctions: polynomial-delay iterators in action
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Maximally joining probabilistic data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Efficient query evaluation on probabilistic databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficiently enumerating results of keyword search over data graphs
Information Systems
Efficiently enumerating results of keyword search
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Generating cut conjunctions and bridge avoiding extensions in graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An abstract framework for generating maximal answers to queries
ICDT'05 Proceedings of the 10th international conference on Database Theory
Constant time generation of trees with specified diameter
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A More Relaxed Model for Graph-Based Data Clustering: $s$-Plex Cluster Editing
SIAM Journal on Discrete Mathematics
Hi-index | 0.01 |
This paper investigates a graph enumeration problem, called the maximalP-subgraphs problem, where P is a hereditary or connected-hereditary graph property. Formally, given a graph G, the maximal P-subgraphs problem is to generate all maximal induced subgraphs of G that satisfy P. This problem differs from the well-known node-deletion problem, studied by Yannakakis and Lewis [J. Lewis, On the complexity of the maximum subgraph problem, in: Proc. 10th Annual ACM Symposium on Theory of Computing, ACM Press, New York, USA, 1978, pp. 265-274; M. Yannakakis, Node- and edge-deletion NP-complete problems, in: Proc. 10th Annual ACM Symposium on Theory of Computing, ACM Press, New York, USA, 1978, pp. 253-264; J. Lewis, M. Yannakakis, The node-deletion problem for hereditary properties is NP-complete, J. Comput. System Sci. 20 (2) (1980) 219-230]. In the maximal P-subgraphs problem, the goal is to produce all (locally) maximal subgraphs of a graph that have property P, whereas in the node-deletion problem, the goal is to find a single (globally) maximum size subgraph with property P. Algorithms are presented that reduce the maximal P-subgraphs problem to an input-restricted version of this problem. These algorithms imply that when attempting to efficiently solve the maximal P-subgraphs problem for a specific P, it is sufficient to solve the restricted case. The main contributions of this paper are characterizations of when the maximal P-subgraphs problem is in a complexity class C (e.g., polynomial delay, total polynomial time).