Pages that link to "Item:Q1339394"
From MaRDI portal
The following pages link to Maximum number of disjoint paths connecting specified terminals in a graph (Q1339394):
Displaying 5 items.
- On paths avoding forbidden pairs of vertices in a graph (Q678872) (← links)
- Maximum graphs not spannable by \(r\) disjoint paths (Q1808830) (← links)
- A linear programming formulation of Mader's edge-disjoint paths problem (Q2581506) (← links)
- Length-constrained path-matchings in graphs (Q3150130) (← links)
- Finding Maximum Edge-Disjoint Paths Between Multiple Terminals (Q6057790) (← links)