A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (Q2827808): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1407.2036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear delay enumeration and monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Monotone Dualization and Generating Hypergraph Transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating minimal dominating sets in chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Enumeration of Minimal Dominating Sets and Related Notions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of the Monomials of a Polynomial and Related Complexity Classes / rank
 
Normal rank

Latest revision as of 19:27, 12 July 2024

scientific article
Language Label Description Also known as
English
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
scientific article

    Statements

    A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 October 2016
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references