Faster Algorithms to Enumerate Hypergraph Transversals
From MaRDI portal
Publication:2802949
DOI10.1007/978-3-662-49529-2_23zbMath1475.68474arXiv1510.05093OpenAlexW2962973738MaRDI QIDQ2802949
Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Serge Gaspers
Publication date: 3 May 2016
Published in: LATIN 2016: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.05093
Analysis of algorithms (68W40) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
This page was built for publication: Faster Algorithms to Enumerate Hypergraph Transversals
