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

DOI10.1007/978-3-030-25005-8_13MaRDI QIDQ2301741zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

enumeration algorithmsFPTirredundant setspolynomial delay

Mathematics Subject Classification ID

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

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

Cited in

(6)

• Irreversible 2-conversion set in graphs of bounded degree
• Enumerating minimal solution sets for metric graph problems
• Enumerating minimal solution sets for metric graph problems
• Hypergraph dualization with \textsf{FPT}-delay parameterized by the degeneracy and dimension
• Enumerating minimal dominating sets and variants in chordal bipartite graphs
• Universal perspectives on irredundance for X-set parameters

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)