Towards the Graph Minor Theorems for Directed Graphs (Q3449461): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial bounds for the grid-minor theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / 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: Highly connected sets and the excluded grid theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding topological subgraphs is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shorter proof of the graph minor algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The disjoint paths problem in quadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Excluded Grid Theorem for Digraphs with Forbidden Minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Directed Grid Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width and planar minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors XXIII. Nash-Williams' immersion conjecture / 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. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding <i>k</i> Disjoint Paths in a Directed Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank

Latest revision as of 00:10, 11 July 2024

scientific article
Language Label Description Also known as
English
Towards the Graph Minor Theorems for Directed Graphs
scientific article

    Statements

    Towards the Graph Minor Theorems for Directed Graphs (English)
    0 references
    0 references
    0 references
    4 November 2015
    0 references
    directed graphs
    0 references
    grid minor
    0 references
    directed disjoint paths problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers