Pages that link to "Item:Q1186594"
From MaRDI portal
The following pages link to Parallel complexity of computing a maximal set of disjoint paths (Q1186594):
Displaying 5 items.
- Parallelism and the maximal path problem (Q1098641) (← links)
- A parallel algorithm for the maximal path problem (Q1100916) (← links)
- An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm (Q1124337) (← links)
- Fast RNC and NC algorithms for maximal path sets (Q1285573) (← links)
- On the complexity of optimal parallel cooperative path-finding (Q2805441) (← links)