Q5075819 (Q5075819): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-treewidth graph decompositions and applications / 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: The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flow, well-linked terminals, and routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 / 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: On Independent Circuits Contained in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Planar Directed Grid Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / 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: The Directed Grid Theorem / 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: Polynomial treewidth forces a large grid-like-minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar 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: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits fractionally / rank
 
Normal rank

Latest revision as of 22:50, 28 July 2024

scientific article; zbMATH DE number 7525509
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7525509

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2022
    0 references
    directed graphs
    0 references
    graph algorithms
    0 references
    linkage
    0 references
    Erdőds-Pósa property
    0 references

    Identifiers