Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity (Q3502644): 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.1007/978-3-540-79228-4_16 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1524294733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank

Latest revision as of 10:52, 28 June 2024

scientific article
Language Label Description Also known as
English
Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity
scientific article

    Statements

    Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity (English)
    0 references
    0 references
    0 references
    27 May 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    graph algorithms
    0 references
    0 references