Pages that link to "Item:Q845919"

The following pages link to A global parallel algorithm for the hypergraph transversal problem (Q845919):

Displaying 12 items.

• Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
• On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
• Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
• On the completability of incomplete Latin squares (Q966163) (← links)
• A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
• Affine planes and transversals in 3-uniform linear hypergraphs (Q2045381) (← links)
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
• Bounds on upper transversals in hypergraphs (Q2292129) (← links)
• The adjacency matrix of a graph as a data table: a geometric perspective (Q2362877) (← links)
• Upper transversals in hypergraphs (Q2422208) (← links)
• The Minimal Hitting Set Generation Problem: Algorithms and Computation (Q2953406) (← links)
• Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)