Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs (Q3449842): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1524268499 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1404.3501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / 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: Enumerating minimal subset feedback vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / 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: An Efficient Algorithm for the Transversal Hypergraph Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating cut conjunctions in graphs and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for dualizing large-scale hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous and accurate enclosure of invariant manifolds on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of the Monomials of a Polynomial and Related Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On enumerating all minimal solutions of feedback problems / rank
 
Normal rank

Latest revision as of 23:25, 10 July 2024

scientific article
Language Label Description Also known as
English
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
scientific article

    Statements

    Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 October 2015
    0 references

    Identifiers

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