Efficient algorithms for dualizing large-scale hypergraphs

DOI10.1137/1.9781611972931.1MaRDI QIDQ5233744zbMATH OpenOpenAlexFDO

Authors Keisuke Murakami, Takeaki Uno

Publication date 12 September 2019

Published in 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611972931.1

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Efficient algorithms for dualizing large-scale hypergraphs
• Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
• Dual-bounded generating problems: Partial and multiple transversals of a hypergraph
• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation

Cited in

(12)

• On the dualization in distributive lattices and related problems
• An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints
• Efficient algorithms for dualizing large-scale hypergraphs
• Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
• Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
• Doubling Algorithms with Permuted Lagrangian Graph Bases
• Exact and approximate minimal pattern mining
• High-Speed and Noise-Robust Embedding of Hypergraphs Based on Double-Centered Incidence Matrix
• Discovery of the D-basis in binary tables based on hypergraph dualization
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling
• Impartial hypergraph games
• Nonlinear paging

This page was built for publication: Efficient algorithms for dualizing large-scale hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233744)