Parameterized Complexity for Domination Problems on Degenerate Graphs (Q5302055): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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.1007/978-3-540-92248-3_18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1524652898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3165942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Allocate Network Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Code is \(W[1]\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding All Spanning Trees of Directed and Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of Vertex Cover variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial vs. Complete Domination: t-Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3333070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal function for contractions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:22, 29 June 2024

scientific article; zbMATH DE number 5494796
Language Label Description Also known as
English
Parameterized Complexity for Domination Problems on Degenerate Graphs
scientific article; zbMATH DE number 5494796

    Statements

    Parameterized Complexity for Domination Problems on Degenerate Graphs (English)
    0 references
    0 references
    0 references
    20 January 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterized complexity
    0 references
    algorithms
    0 references
    degenerate graphs
    0 references
    domination
    0 references
    0 references