Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs

DOI10.1007/978-3-030-25005-8_13OpenAlexW2957146964MaRDI QIDQ2301741

Mamadou Moustapha Kanté, Takeaki Uno, Andrea Marino, Alessio Conte

Publication date: 25 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-25005-8_13

zbMATH Keywords

FPTpolynomial delayenumeration algorithmsirredundant sets

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

This page was built for publication: Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs