# Polynomially solvable cases of hypergraph transversal and related problems

@inproceedings{Rauf2011PolynomiallySC, title={Polynomially solvable cases of hypergraph transversal and related problems}, author={I. Rauf}, year={2011} }

This thesis is mainly concerned with the hypergraph transversal problem, which asks to generate all minimal transversals of a given hypergraph. While the current best upper bound on the complexity of the problem is quasi-polynomial in the combined input and output sizes, it is shown to be solvable in output polynomial time for a number of hypergraph classes. We extend this polynomial frontier to the hypergraphs induced by hyperplanes and constant-sided polytopes in fixed dimension R and… Expand

#### Figures, Tables, and Topics from this paper

#### 5 Citations

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width

- Mathematics, Computer Science
- ISAAC
- 2015

All 1-minimal and all 1-maximal and therefore all minimal dominating sets, and hence all minimal dominate sets, of graphs of bounded LMIM-width can be enumerated with polynomial (linear) delay usingPolynomial space. Expand

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width

- Mathematics, Computer Science
- Algorithmica
- 2017

It is shown that all 1-minimal and all1-maximal and hence all minimal dominating sets, of graphs of bounded LMIM-width can be enumerated with polynomial (linear) delay usingPolynomial space. Expand

Hypergraphs and Exact Transversals

- Mathematics
- 2017

The notion of a hypergraph was first used in the second half of the previous century. In 1973, a French mathematician, Claude Berge, published a monograph, in which a knowledge of hypergraphs was… Expand

Algorithms and Computation

- Computer Science
- Lecture Notes in Computer Science
- 2015

This talk presents extensions of Myerson’s celebrated single-item auction to multi-item settings, and presents computationally efficient, approximation-preserving reductions from mechanism design to algorithm design in general Bayesian settings. Expand

C-Exact Hypergraphs in Concurrency and Sequentiality Analyses of Cyber-Physical Systems Specified by Safe Petri Nets

- Computer Science
- IEEE Access
- 2019

The paper proposes the novel concurrency and sequentiality analysis techniques of a cyber-physical system specified by a safe Petri net based on the hypergraph theory and apply computation of exact transversals in a c-exact hypergraph. Expand

#### References

SHOWING 1-10 OF 79 REFERENCES

An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation

- Computer Science, Mathematics
- Discret. Appl. Math.
- 2006

An efficient implementation of an incremental quasi-polynomial-time algorithm for solving the hypergraph transversal problem, and experimental results are presented to evaluate the implementation for a number of interesting monotone properties π. Expand

Exact Transversal Hypergraphs and Application to Boolean µ-Functions

- Computer Science, Mathematics
- J. Symb. Comput.
- 1994

It is shown that hypergraphs are recognizable in polynomial time and that their minimal transversals as well as their maximal independent sets can be generated in lexicographic order withPolynomial delay between subsequent outputs, which is impossible in the general case unless P= NP. Expand

On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2007

It is shown that for hypergraphs with k+r≤const, problem is NC-reducible to the problem of generating a single MIS for a partial subhypergraph of . Expand

A global parallel algorithm for the hypergraph transversal problem

- Computer Science, Mathematics
- Inf. Process. Lett.
- 2007

A new decomposition technique is given for solving the problem of finding all minimal transversals of a hypergraph H@?2^V, given by an explicit list of its hyperedges with the following advantages: global parallelism, and new results on the complexity of generating minimalTransversals for new classes of hypergraphs. Expand

On the complexity of monotone dualization and generating minimal hypergraph transversals

- Computer Science, Mathematics
- Discret. Appl. Math.
- 2008

The decomposition technique can be thought of as a generalization of that of Fredman and Khachiyan, and yields stronger bounds on the sequential complexity of the problem in the case when the sizes of f and g are significantly different, and allows for generating all minimal transversals of a given hypergraph using only polynomial space. Expand

Transversal Hypergraphs and Families of Polyhedral Cones

- Mathematics
- 2001

We discuss the complexity of generating certain geometric configurations related to the classical theorems of Caratheodory and Helly. Given a set K of rational cones in n dimensions and a rational… Expand

Identifying the Minimal Transversals of a Hypergraph and Related Problems

- Mathematics, Computer Science
- SIAM J. Comput.
- 1995

Two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, are considered and their significance for several search problems in applied computer science is discussed. Expand

Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems

- Computer Science, Mathematics
- IWPEC
- 2008

This paper uses an Apriori approach to obtain FPT results for generating all maximal independent sets of a hypergraph, all minimaltransversals of ahypergraph, and all maximal frequent sets where parameters bound the intersections or unions of edges. Expand

New results on monotone dualization and generating hypergraph transversals

- Mathematics, Computer Science
- STOC '02
- 2002

It is shown that duality of two monotone CNFs can be disproved with limited nondeterminism, and a number of new polynomial time resp. Expand

Evaluation of an Algorithm for the Transversal Hypergraph Problem

- Computer Science
- WAE
- 1999

A heuristic algorithm is presented and experimentally evaluated for the Transversal Hypergraph Problem, which seems able to handle large instances and also possesses some nice features especially desirable in problems with large output such as the transversal hypergraph problem. Expand