On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay

Authors:
Taishin Daigo;Kouichi Hirata
Affiliations:
Graduate School of Computer Science and Systems Engineering,;Department of Artificial Intelligence, Kyushu Institute of Technology, Iizuka, Japan 820-8502
Venue:
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Year:
2009

Citing 13
Cited 0

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
On generating all maximal independent sets

Information Processing Letters
On hypergraph acyclicity and graph chordality

Information Processing Letters
Algorithms for Enumerating All Spanning Trees ofUndirected and Weighted Graphs

SIAM Journal on Computing
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs

SIAM Journal on Computing
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes

Journal of the ACM (JACM)
Conjunctive query containment revisited

Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
The complexity of acyclic conjunctive queries

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graphs and Hypergraphs

Graphs and Hypergraphs
Frequent Hypergraph Mining

Inductive Logic Programming
On finding acyclic subhypergraphs

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

An acyclic subhypergraph of a hypergraph is maximal if there exists no acyclic subhypergraph containing it. In this paper, first we show that, unless P=NP, there is no polynomial delay algorithm for generating all maximal acyclic subhypergraphs in lexicographic order . Next, by ignoring the order of outputs, we design a polynomial delay algorithm for generating all maximal acyclic subhypergraphs.