Identifying the Minimal Transversals of a Hypergraph and Related Problems
- 1 December 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (6) , 1278-1304
- https://doi.org/10.1137/s0097539793250299
Abstract
No abstract availableThis publication has 34 references indexed in Scilit:
- Complexity of Identification and Dualization of Positive Boolean FunctionsInformation and Computation, 1995
- Diagnosing multiple faultsArtificial Intelligence, 1987
- The poset of closures as a model of changing databasesOrder, 1987
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- On the Structure of Armstrong Relations for Functional DependenciesJournal of the ACM, 1984
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- Degrees of acyclicity for hypergraphs and relational database schemesJournal of the ACM, 1983
- Using Semi-Joins to Solve Relational QueriesJournal of the ACM, 1981
- Critical hypergraphs for the weak chromatic numberJournal of Combinatorial Theory, Series B, 1980
- Existence theorems for Sperner familiesJournal of Combinatorial Theory, Series A, 1974