Enumerating minimal dominating sets in chordal bipartite graphs (Q896653): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Mamadou Moustapha Kanté / rank
Normal rank
 
Property / author
 
Property / author: Mamadou Moustapha Kanté / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2014.12.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084621880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual subimplicants of positive Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / 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: Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact transversal hypergraphs and application to Boolean \(\mu\)-functions / 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: Q4708957 / 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: Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs / 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: Perfect Elimination and Chordal Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent 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 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 and Counting of Minimal Dominating sets in Interval and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all vertices of a polyhedron is hard / 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: On enumerating minimal dicuts and strongly connected subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph / 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: The Maximum Latency and Identification of Positive Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness: A retrospective / rank
 
Normal rank
Property / cites work
 
Property / cites work: On enumerating all minimal solutions of feedback problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of the Elementary Circuits of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset / rank
 
Normal rank

Latest revision as of 05:19, 11 July 2024

scientific article
Language Label Description Also known as
English
Enumerating minimal dominating sets in chordal bipartite graphs
scientific article

    Statements

    Enumerating minimal dominating sets in chordal bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 December 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    minimal dominating set
    0 references
    enumeration
    0 references
    output polynomial algorithm
    0 references
    0 references
    0 references
    0 references