The following pages link to (Q3815886):
Displaying 8 items.
- An optimal parallel processor bound in strong orientation of an undirected graph (Q1062459) (← links)
- The parallel complexity of approximating the high degree subgraph problem (Q1275085) (← links)
- A parallel algorithm for nearly optimal edge search (Q1350305) (← links)
- \(k\)-edge subgraph problems (Q1356515) (← links)
- The maximum degree \& diameter-bounded subgraph and its applications (Q2392540) (← links)
- Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model' (Q3493247) (← links)
- Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model (Q3801099) (← links)
- The parallel complexity of approximating the High Degree Subgraph problem (Q6487954) (← links)