The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Identifying the Minimal Transversals of a Hypergraph and Related Problems
Abstract
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 $\mathcal{H}$, decide if every subset of vertices is contained in or contains some edge of $\mathcal{H}$) is shown to be co-${\bf NP}$-complete. A certain subproblem of hypergraph saturation, the saturation of simple hypergraphs (i.e., Sperner families), is shown to be under polynomial transformation equivalent to transversal hypergraph recognition; i.e., given two hypergraphs $\mathcal{H}_{1}$, $\mathcal{H}_{2}$, decide if the sets in $\mathcal{H}_{2}$ are all the minimal transversals of $\mathcal{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; it is unknown whether an output-polynomial algorithm exists. For several important subcases (for instance, if an upper or lower bound is imposed on the edge size or for acyclic hypergraphs) output-polynomial algorithms are presented. 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 artificial intelligence (AI), particularly in model-based diagnosis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
A theory of diagnosis from first principles
Reiter, R. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90062-2 · Cited by 3,031
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Principles of database and knowledge-base systems
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5107 · Cited by 2,683
Some simplified NP-complete graph problems
Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90059-1 · Cited by 2,059
de Kleer, J., & Williams, B. C. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90063-4 · Cited by 2,039
Iverson, K. E. (1962) · Proceedings of the May 1-3, 1962, spring joint computer conference on - AIEE-IRE '62 (Spring) · doi:10.1145/1460833.1460872 · Cited by 1,067
Tarjan, R. E., & Yannakakis, M. (1984) · SIAM Journal on Computing · doi:10.1137/0213035 · Cited by 1,058
On the Desirability of Acyclic Database Schemes
Beeri, C., Fagin, R., Maier, D., & Yannakakis, M. (1983) · Journal of the ACM · doi:10.1145/2402.322389 · Cited by 808
The NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
Algorithms for acyclic database schemes
Yannakakis, M. (1981) · Very Large Data Bases · Cited by 786
On generating all maximal independent sets
Johnson, D. S., Yannakakis, M., & Papadimitriou, C. H. (1988) · Information Processing Letters · doi:10.1016/0020-0190(88)90065-8 · Cited by 771
A taxonomy of problems with fast parallel algorithms
Cook, S. A. (1985) · Information and Control · doi:10.1016/s0019-9958(85)80041-3 · Cited by 641
NP is as easy as detecting unique solutions
Valiant, L. G., & Vazirani, V. V. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90135-0 · Cited by 635
How to assign votes in a distributed system
Garcia-Molina, H., & Barbara, D. (1985) · Journal of the ACM · doi:10.1145/4221.4223 · Cited by 563
Using Semi-Joins to Solve Relational Queries
Bernstein, P. A., & Chiu, D.-M. W. (1981) · Journal of the ACM · doi:10.1145/322234.322238 · Cited by 464
The Complexity of Boolean Functions
(2005) · Complexity Theory · doi:10.1007/3-540-27477-4_16 · Cited by 376
A simplied universal relation assumption and its properties
Fagin, R., Mendelzon, A. O., & Ullman, J. D. (1982) · ACM Transactions on Database Systems · doi:10.1145/319732.319735 · Cited by 296
Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1980) · SIAM Journal on Computing · doi:10.1137/0209042 · Cited by 285
Elements of Relational Database Theory
KANELLAKIS, P. C. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50022-6 · Cited by 259
The implementation of reliable distributed multiprocess systems
Lamport, L. (1978) · Computer Networks (1976) · doi:10.1016/0376-5075(78)90045-4 · Cited by 233
Graph isomorphism is in the low hierarchy
Schöning, U. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90010-4 · Cited by 229
Lucchesi, C. L., & Osborn, S. L. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90009-0 · Cited by 160
An algorithm for tree-query membership of a distributed query
Yu, C., & Özsoyoğlu, M. (2005) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/cmpsac.1979.762509 · Cited by 112
Covering Problems: Duality Relations and a New Method of Solution
Lawler, E. L. (1966) · SIAM Journal on Applied Mathematics · doi:10.1137/0114089 · Cited by 44
The poset of closures as a model of changing databases
Burosch, G., Demetrovics, J., & Katona, G. O. H. (1987) · Order · doi:10.1007/bf00337692 · Cited by 34
The NP-completeness column: An ongoing guide
Johnson, D. S. (1988) · Journal of Algorithms · doi:10.1016/0196-6774(88)90033-8 · Cited by 33
Cited by
Invitation to Fixed-Parameter Algorithms
Niedermeier, R. (2006) · doi:10.1093/acprof:oso/9780198566076.001.0001 · Cited by 1,668
Metadata
- Authors
- Eiter, T., & Gottlob, G.
- Venue
- SIAM Journal on Computing
- Published
- 1995-12
- Volume
- 24
- Issue
- 6
- Pages
- 1278-1304
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W1972004026
- Cited by
- 437
- References
- 27
- FWCI
- 11.73
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.