The following pages link to Prasad Chebolu (Q414429):
Displaying 11 items.
- Exact counting of Euler tours for generalized series-parallel graphs (Q414430) (← links)
- The complexity of approximately counting stable roommate assignments (Q440007) (← links)
- The complexity of approximately counting stable matchings (Q441846) (← links)
- (Q850079) (redirect page) (← links)
- Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time (Q3521916) (← links)
- Finding a maximum matching in a sparse random graph in <i>O</i> ( <i>n</i> ) expected time (Q3578203) (← links)
- (Q3579421) (← links)
- The Complexity of Approximately Counting Stable Matchings (Q3588401) (← links)
- Hamilton Cycles in Random Lifts of Directed Graphs (Q3629460) (← links)
- Average-Case Analyses of Vickrey Costs (Q3638896) (← links)
- Hamilton cycles in random lifts of graphs (Q5898131) (← links)
