Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621): 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-642-16926-7_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2143396993 / 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: On Problems without Polynomial Kernels (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompressibility through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and Approximation Results for the Connected Vertex Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensionality and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity for Domination Problems on Degenerate Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of the Hadwiger number of graphs by their average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT Algorithms for Connected Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels / 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

Latest revision as of 12:06, 3 July 2024

scientific article
Language Label Description Also known as
English
Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs
scientific article

    Statements

    Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (English)
    0 references
    0 references
    0 references
    0 references
    16 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references