Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q60488458 / rank
 
Normal rank
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.jcss.2012.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015321560 / 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: Parameterized complexity: exponential speed-up for planar graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tour Merging via Branch-Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the Hamiltonian cycle problem in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensional Parameters and Local Treewidth / 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: Q2921717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearity of grid minors in treewidth with applications through bidimensionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up / 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: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler algorithm and shorter proof for the graph minor decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights / 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: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time low tree-width partitions and algorithmic consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On limited nondeterminism and the complexity of the V-C dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming for Graphs on Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. VII: Disjoint paths on a surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XI: Circuits on a surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddings of graphs with no short noncontractible cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring a Family of Circular Arcs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:22, 5 July 2024

scientific article
Language Label Description Also known as
English
Catalan structures and dynamic programming in \(H\)-minor-free graphs
scientific article

    Statements

    Catalan structures and dynamic programming in \(H\)-minor-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    17 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterized complexity
    0 references
    longest path
    0 references
    minor-free graphs
    0 references
    Catalan structure
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references