Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.03.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093334671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Maximal Independent Sets and Faster Exact Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum feedback vertex set problem: Exact and enumeration algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bounds via measure and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating Minimal Subset Feedback Vertex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Induced Subgraphs via Minimal Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback Vertex Sets in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for Dominating Set Analyzed by the Potential Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Minimal Dominating Sets and Variants / 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: The domatic number problem on some perfect graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees having many minimal dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of the chromatic number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal greedy algorithms for indifference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Comparability Graph of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:23, 7 July 2024

scientific article
Language Label Description Also known as
English
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
scientific article

    Statements

    Minimal dominating sets in graph classes: combinatorial bounds and enumeration (English)
    0 references
    0 references
    0 references
    0 references
    11 December 2013
    0 references
    minimal dominating sets
    0 references
    enumeration algorithms
    0 references
    combinatorial bounds
    0 references
    graph classes
    0 references
    0 references
    0 references
    0 references

    Identifiers