Pages that link to "Item:Q1124337"
From MaRDI portal
The following pages link to An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm (Q1124337):
Displaying 5 items.
- New solutions for disjoint paths in P systems (Q256435) (← links)
- Implicit computation of maximum bipartite matchings by sublinear functional operations (Q477185) (← links)
- A parallel algorithm for the maximal path problem (Q1100916) (← links)
- Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations (Q2898059) (← links)
- Improved approximation for node-disjoint paths in planar graphs (Q5361861) (← links)