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

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

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

Publication date: 25 February 2020

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

Recommendations

• Enumeration of maximal irredundant sets for claw-free graphs
• Enumeration of maximal irredundant sets for claw-free graphs
• Listing Maximal Independent Sets with Minimal Space and Bounded Delay
• Efficient enumeration of dominating sets for sparse graphs
• Efficient enumeration of dominating sets for sparse graphs

zbMATH Keywords

FPTpolynomial delayenumeration algorithmsirredundant sets

Mathematics Subject Classification ID

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

Cited In (1)

• Irreversible 2-conversion set in graphs of bounded degree

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

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