The following pages link to Alak Kumar Datta (Q1606954):
Displaying 8 items.
- (Q672493) (redirect page) (← links)
- 1-Approximation algorithm for bottleneck disjoint path matching (Q672495) (← links)
- An efficient scheme to solve two problems for two-terminal series parallel graphs (Q1606956) (← links)
- Approximate spanning cactus (Q2353648) (← links)
- Spanning cactus: complexity and extensions (Q2410246) (← links)
- IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH (Q4485123) (← links)
- A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST SEARCH (Q4820076) (← links)
- <i>o</i>(log<sup>4</sup> <i>n</i>) time parallel maximal matching algorithm using linear number of processors (Q4826117) (← links)