Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs (Q2839212): 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.1016/j.endm.2009.02.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063956355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-Constrained Subgraph Problems: Hardness and Approximation Results / 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: Subexponential Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the decomposability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal branch-decomposition of planar graphs in <i>O</i> ( <i>n</i> <sup>3</sup> ) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:15, 6 July 2024

scientific article
Language Label Description Also known as
English
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs
scientific article

    Statements

    Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs (English)
    0 references
    0 references
    0 references
    4 July 2013
    0 references
    0 references
    parameterized complexity
    0 references
    planar graphs
    0 references
    subexponential algorithm
    0 references
    branch decomposition
    0 references
    graph minors
    0 references
    bidimensionality
    0 references
    Catalan structures
    0 references
    0 references