An Efficient Algorithm for the Transversal Hypergraph Generation
From MaRDI portal
Publication:3378517
DOI10.7155/jgaa.00107zbMath1088.05069OpenAlexW2161541700MaRDI QIDQ3378517
Elias C. Stavropoulos, Dimitris J. Kavvadias
Publication date: 3 April 2006
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/52369
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (21)
On Tackling Explanation Redundancy in Decision Trees ⋮ A note on systems with max-min and max-product constraints ⋮ Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs ⋮ A New Approach to Partial MUS Enumeration ⋮ On the fixed-parameter tractability of the equivalence test of monotone normal forms ⋮ Impartial hypergraph games ⋮ The Minimal Hitting Set Generation Problem: Algorithms and Computation ⋮ Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation ⋮ Node sampling for protein complex estimation in bait-prey graphs ⋮ Efficient algorithms for dualizing large-scale hypergraphs ⋮ Enumerating Minimal Transversals of Hypergraphs without Small Holes ⋮ Computational aspects of monotone dualization: a brief survey ⋮ How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms ⋮ Algorithms for computing minimal unsatisfiable subsets of constraints ⋮ Fast algorithms for implication bases and attribute exploration using proper premises ⋮ Using Transversals for Discovering XML Functional Dependencies ⋮ Masking patterns in sequences: A new class of motif discovery with don't cares ⋮ Resolution based algorithms for the transversal hypergraph generation problem ⋮ Combinatorial optimization in system configuration design ⋮ Lower bounds for three algorithms for transversal hypergraph generation ⋮ An average study of hypergraphs and their minimal transversals
Uses Software
This page was built for publication: An Efficient Algorithm for the Transversal Hypergraph Generation
