A complexity dichotomy and a new boundary class for the dominating set problem (Q328713): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1669582
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Dmitriy S. Malyshev / 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.1007/s10878-015-9872-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047820500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dichotomy for Upper Domination in Monogenic Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On easy and hard hereditary classes of graphs with respect to the independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard graph problems and boundary classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary classes of graphs for the dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets for split and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New graph classes of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating the complexity status of coloring graphs without a fixed induced linear forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List coloring in the absence of two subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs characterized by a forbidden subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-coloring \(H\)-free graphs when \(H\) is small / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary Classes of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of domination number determination in monogenic classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination and total domination on asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex coloring of graphs with few obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in extensions of 2\(K_{2}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of graphs critical for the edge list-ranking problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405639 / rank
 
Normal rank

Latest revision as of 19:17, 12 July 2024

scientific article
Language Label Description Also known as
English
A complexity dichotomy and a new boundary class for the dominating set problem
scientific article

    Statements

    A complexity dichotomy and a new boundary class for the dominating set problem (English)
    0 references
    20 October 2016
    0 references
    dominating set
    0 references
    computational complexity
    0 references
    polynomial-time algorithm
    0 references
    boundary class
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers