Evaluation of an Algorithm for the Transversal Hypergraph Problem

Authors:
Dimitris Kavvadias;Elias C. Stavropoulos
Affiliations:
-;-
Venue:
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Year:
1999

Citing 13
Cited 5

How to assign votes in a distributed system

Journal of the ACM (JACM)
Design by exmple: An application of Armstrong relations

Journal of Computer and System Sciences
On generating all maximal independent sets

Information Processing Letters
Model-preference default theories

Artificial Intelligence
The complexity of model checking for circumscriptive formulae

Information Processing Letters
Characterizing diagnoses and systems

Artificial Intelligence
Algorithms for inferring functional dependencies from relations

Data & Knowledge Engineering
The complexity of selecting maximal solutions

Information and Computation
Identifying the Minimal Transversals of a Hypergraph and Related Problems

SIAM Journal on Computing
On the complexity of dualization of monotone disjunctive normal forms

Journal of Algorithms
Data mining, hypergraph transversals, and machine learning (extended abstract)

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Inverse Satisfiability Problem

SIAM Journal on Computing
NP-Completeness: A Retrospective

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming

A Fast Algorithm for Computing Hypergraph Transversals and its Application in Mining Emerging Patterns

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
On the relation between jumping emerging patterns and rough set theory with application to data classification

Transactions on rough sets XII
Left-to-Right Multiplication for Monotone Boolean Dualization

SIAM Journal on Computing
Trace spaces: an efficient new technique for state-space reduction

ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Transversal Hypergraph Problem is the problem of computing, given a hypergraph, the set of its minimal transversals, i.e. the hypergraph whose hyperedges are all minimal hitting sets of the given one. This problem turns out to be central in various fields of Computer Science. We present and experimentally evaluate a heuristic algorithm for the 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.