A decidability result for the dominating set problem (Q410736): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.2010.08.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2147525506 / 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: NP-hard graph problems and boundary classes of 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: Domination in convex and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs and well‐quasi‐ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive advances in polynomial-time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive tools for proving polynomial-time decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3558598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3353058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line graphs and forbidden induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / 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 01:47, 5 July 2024

scientific article
Language Label Description Also known as
English
A decidability result for the dominating set problem
scientific article

    Statements

    A decidability result for the dominating set problem (English)
    0 references
    0 references
    3 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    dominating set
    0 references
    computational complexity
    0 references
    decidability
    0 references
    well-quasi-order
    0 references
    non-constructive proof
    0 references
    0 references