English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

At STOC 2002, Eiter, Gottlob, and Makino presented a technique called orderedgeneration that yields an $n^{O(d)}$-delay algorithm listing all minimaltransversals of an $n$-vertex hypergraph of degeneracy $d$. Recently at IWOCA2019, Conte, Kant\'e, Marino, and Uno asked whether this XP-delay algorithmparameterized by $d$ could be made FPT-delay parameterized by $d$ and themaximum degree $\Delta$, i.e., an algorithm with delay $f(d,\Delta)\cdotn^{O(1)}$ for some computable function $f$. Moreover, as a first step towardanswering that question, they note that the same delay is open for theintimately related problem of listing all minimal dominating sets in graphs. Inthis paper, we answer the latter question in the affirmative.

Minimal dominating sets enumeration with FPT-delay parameterized by the degeneracy and maximum degree