Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-007-9138-y / 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: \(K_{a,k}\) minors in graphs of bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear connectivity forces large complete bipartite minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of planar graphs: connections with duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448744 / 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: Approximation Algorithms for Independent Sets in Map Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly deciding minor-closed parameters in general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensional Parameters and Local Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for classes of graphs excluding single-crossing graphs as minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bidimensional Theory of Bounded-Genus Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly connected sets and the excluded grid theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity, graph minors, and subgraph multiplicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive tools for proving polynomial-time decidability / 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: Kernels in planar digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graph Powers for Leaf-Labeled Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected ST-connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. IX: Disjoint crossed paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273877 / 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. XII: Distance on a surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a 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: Excluding Minors in Nonplanar Graphs of Girth at Least Five / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-007-9138-Y / rank
 
Normal rank

Latest revision as of 13:24, 10 December 2024

scientific article
Language Label Description Also known as
English
Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
scientific article

    Statements

    Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (English)
    0 references
    0 references
    22 June 2009
    0 references
    graph minors
    0 references
    graph algorithms
    0 references
    grid graphs
    0 references
    treewidth
    0 references
    bidimensionality
    0 references
    Wagner's conjecture
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references