The following pages link to (Q4471352):
Displaying 28 items.
- Approximation algorithms for orienting mixed graphs (Q390889) (← links)
- LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- On the Max-flow min-cut ratio for directed multicommodity flows (Q818146) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- A note on the greedy algorithm for the unsplittable flow problem (Q1028992) (← links)
- Flows with unit path capacities and related packing and covering problems (Q1041430) (← links)
- Edge-disjoint homotopic paths in a planar graph with one hole (Q1097900) (← links)
- The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint (Q1346794) (← links)
- Reconstructing edge-disjoint paths. (Q1413914) (← links)
- On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
- Non-shared edges and nearest neighbor interchanges revisited (Q2390296) (← links)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- On the disjoint paths problem (Q2643811) (← links)
- Routing in undirected graphs with constant congestion (Q2817791) (← links)
- Single-Sink Multicommodity Flow with Side Constraints (Q2971620) (← links)
- (Q3615433) (← links)
- Vertex-disjoint paths and edge-disjoint branchings in directed graphs (Q3797196) (← links)
- (Q3999955) (← links)
- (Q4952693) (← links)
- Shortest edge-disjoint paths in graphs (Q5096182) (← links)
- (Q5136255) (← links)
- Approximability of Packing Disjoint Cycles (Q5387766) (← links)
- Flows on few paths: Algorithms and lower bounds (Q5487813) (← links)
- (Q5688100) (← links)
- Edge Disjoint Paths in Moderately Connected Graphs (Q5893911) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902517) (← links)
- Solving the edge‐disjoint paths problem using a two‐stage method (Q6066718) (← links)
