Packing directed circuits quarter-integrally
From MaRDI portal
Publication:5075819
Recommendations
Cites work
- A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
- An excluded grid theorem for digraphs with forbidden minors
- Constant congestion routing of symmetric demands in planar directed graphs
- Directed tree-width
- Graph minors. III. Planar tree-width
- Graph minors. V. Excluding a planar graph
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
- Introducing directed tree width
- Large-treewidth graph decompositions and applications
- Linearity of grid minors in treewidth with applications through bidimensionality
- Multicommodity flow, well-linked terminals, and routing problems
- On Independent Circuits Contained in a Graph
- Packing directed circuits
- Packing directed circuits fractionally
- Polynomial bounds for the grid-minor theorem
- Polynomial planar directed grid theorem
- Polynomial treewidth forces a large grid-like-minor
- Quickly excluding a planar graph
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs
- The directed grid theorem
Cited in
(5)
This page was built for publication: Packing directed circuits quarter-integrally
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075819)