Efficient Algorithms for Dualizing Large-Scale Hypergraphs

DOI10.1137/1.9781611972931.1zbMath1430.05083OpenAlexW1630375812MaRDI QIDQ5233744

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

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

Related Items (2)

Impartial hypergraph games ⋮ Exact and Approximate Minimal Pattern Mining

This page was built for publication: Efficient Algorithms for Dualizing Large-Scale Hypergraphs