The following pages link to (Q4875193):
Displaying 12 items.
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
- Spanning trees in random graphs (Q2326663) (← links)
- (Q3355218) (← links)
- Improved Algorithms for the 2-Vertex Disjoint Paths Problem (Q3599102) (← links)
- An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs (Q4015475) (← links)
- (Q4442188) (← links)
- Efficient algorithms for minimal disjoint path problems on chordal graphs (Q4882587) (← links)
- Rolling backwards can move you forward: On embedding problems in sparse expanders (Q5082387) (← links)
- A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks (Q5357510) (← links)
- Decomposing Random Graphs into Few Cycles and Edges (Q5364258) (← links)
- Towards the Erdős-Gallai cycle decomposition conjecture (Q6184561) (← links)
- Perfect matching in random graphs is as hard as Tseitin (Q6562700) (← links)
