Pages that link to "Item:Q3084217"
From MaRDI portal
The following pages link to Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs (Q3084217):
Displayed 23 items.
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Edge-disjoint branchings in temporal digraphs (Q2236804) (← links)
- Routing with congestion in acyclic digraphs (Q2274522) (← links)
- The directed 2-linkage problem with length constraints (Q2304550) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- A tight lower bound for edge-disjoint paths on planar DAGs (Q2692724) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Evaluation and Enumeration Problems for Regular Path Queries (Q3305367) (← links)
- Congestion-Free Rerouting of Flows on DAGs (Q5002832) (← links)
- Edge-Disjoint Branchings in Temporal Graphs (Q5041184) (← links)
- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. (Q5089241) (← links)
- Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- Half-integral linkages in highly connected directed graphs (Q5111723) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
- Chordless Cycle Packing Is Fixed-Parameter Tractable (Q5874543) (← links)
- On the complexity of finding internally vertex-disjoint long directed paths (Q5918120) (← links)
- Parameterizing path partitions (Q6057329) (← links)
- Packing arc-disjoint cycles in oriented graphs (Q6126480) (← links)
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)