The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance for several search problems in applied computer science. Hypergraph saturation, i.e., given a hypergraph H, decide if every subset of vertices is contained in or contains some edge of H, is shown to be co-NP-complete. A certain subproblem of hypergraph saturation, the saturation of simple hypergraphs, is shown to be computationally equivalent to transversal hypergraph recognition, i.e., given two hypergraphs H 1; H 2, decide if the sets in H 2 are all the minimal transversals of H 1. The complexity of the search problem related to the recognition of the transversal hypergraph, the computation of the transversal hypergraph, is an open problem. This task needs time exponential in the input size, but it is unknown whether an output-polynomial algorithm exists for this problem. For several important subcases, for instance if an upper or lower bound is imposed on the edge size or for acyclic hypergraphs, we present output-polynomial algorithms. Computing or recognizing the minimal transversals of a hypergraph is a frequent problem in practice, which is pointed out by identifying important applications in database theory, Boolean switching theory, logic, and AI, particularly in model-based diagnosis.
|
7709
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
661
|
A theory of diagnosis from first principles
– Reiter
- 1987
|
|
521
|
Diagnosing multiple faults
– deKleer, Williams
- 1987
|
|
374
|
Concrete Mathematics
– Graham, Knuth, et al.
- 1989
|
|
346
|
The Theory of Relational Databases
– Maier
- 1986
|
|
326
|
The complexity of computing the permanent
– Valiant
- 1979
|
|
304
|
Some Simplified NP-Complete Graph Problems
– Garey, Johnson, et al.
- 1976
|
|
213
|
Principles of Database and
– ULLMAN
- 1988
|
|
196
|
A taxonomy of problems with fast parallel algorithms
– COOK
- 1985
|
|
173
|
V.V.: NP is as easy as detecting unique solutions
– Valiant, Vazirani
- 1986
|
|
168
|
How to Assign Votes in a Distributed System
– Garcia-Molina, Barbara
- 1985
|
|
160
|
A Programming Language
– Iverson
- 1962
|
|
157
|
The NP-completeness column: an ongoing guide
– Johnson
- 1984
|
|
132
|
Problems and results on 3-chromatic hypergraphs and some related questions
– Erdos, Lov'asz
- 1975
|
|
127
|
On the desirability of acyclic database schemes
– Beeri, Fagin, et al.
- 1983
|
|
106
|
Minimization of boolean functions
– McCluskey
- 1956
|
|
81
|
Computational Problems Related to the Design of Normal Form Relational Schemas
– Beeri, Bernstein
- 1979
|
|
76
|
A fast parallel algorithm for the maximal independent set problem
– Karp, Wigderson
- 1985
|
|
73
|
Ein Satz uber Untermengen einer endlichen Menger
– Sperner
- 1928
|
|
68
|
Dependency Structures of Data Base Relationships
– Armstrong
- 1974
|
|
67
|
A new algorithm for generating all the maximal independent sets
– Tsukiyama, Ide, et al.
- 1977
|
|
65
|
Algorithms for acyclic database schemes
– Yannakakis
- 1981
|
|
60
|
A correction to the algorithm in Reiter’s theory of diagnosis
– Greiner, Smith, et al.
- 1989
|
|
55
|
The implementation of reliable distributed multiprocess systems
– Lamport
- 1978
|
|
52
|
Coverings and colorings of hypergraphs
– Lovász
- 1973
|
|
51
|
Degrees of acyclicity for hypergraphs and relational database schemes
– Fagin
- 1983
|
|
44
|
A simplified universal relation assumption and its properties
– Fagin, Mendelzon, et al.
- 1982
|
|
43
|
Graph isomorphism is in the low hierarchy
– Schöning
- 1988
|
|
34
|
An incremental method for generating prime implicants/implicates
– Kean, Tsiknis
- 1990
|
|
33
|
Minimal Non-Two-Colorable Hypergraphs and Minimal Unsatisfiable Formulas
– Aharoni, Linial
- 1986
|
|
32
|
A low and a high hierarchy within NP
– Schoning
- 1983
|
|
31
|
On the structure of Armstrong relations for functional dependencies
– Beeri, Dowd, et al.
- 1984
|
|
30
|
Candidate Keys for Relations
– Lucchesi, Osborn
- 1978
|
|
27
|
Reducibility, randomness, and intractability
– Adleman, Manders
- 1977
|
|
24
|
On cores and prime implicants of truth functions
– Quine
- 1959
|
|
20
|
On the universal relation
– Graham
- 1979
|
|
20
|
A new algorithm for generating prime implicants
– Slagle, Chang, et al.
- 1970
|
|
19
|
Generating all maximal independent sets: NP-hardness and polynomial-time algorithms
– Lawler, Lenstra, et al.
- 1980
|
|
19
|
On chromatic number of finite set-systems
– Lovász
- 1968
|
|
17
|
Computing prime implicants
– Jackson, Pais
- 1990
|
|
9
|
Enhancing Concurrency and Availability for Database Systems
– Fu
- 1990
|
|
9
|
Theory of Coteries
– Ibaraki, Kameda
- 1990
|
|
8
|
Minimal keys and antikeys
– Thi
- 1986
|
|
7
|
The poset of closures as a model of changing databases
– Burosch, Demetrovics, et al.
- 1987
|
|
6
|
Existence Theorems for Sperner Families
– Daykin, Godfrey, et al.
- 1974
|
|
5
|
Tarsi M., Deciding hypergraph 2-colorability by H-resolution
– Linial
- 1985
|
|
5
|
Practical algorithms for finding prime attributes and testing normal forms
– Mannila, Raiha
- 1989
|
|
5
|
Tarjan and Mihalis Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
– Robert
- 1984
|
|
5
|
The Complexity of Boolean Functions. Wiley - Teubner series in computer science
– Wegener
- 1987
|
|
4
|
Formal tools for top-down and bottom-up generation of acyclic relational schemata
– Batini, D'Atri, et al.
- 1981
|
|
