|
|
eCommons@Cornell >
Browsing by Author Vazirani, Vijay V.
Showing results 1 to 10 of 10
| Preview | Issue Date | Title | Author(s) | | Aug-1991 | Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets | Pearson, David; Vazirani, Vijay V. |
| Dec-1986 | NC Algorithms for Comparability Graphs, Interval Graphs, and Unique Perfect Matchings | Kozen, Dexter; Vazirani, Umesh V.; Vazirani, Vijay V. |
| Aug-1987 | NC Algorithms for Computing the Number of Perfect Matchings in $K_{3,3}$-free Graphs and Related Problems | Vazirani, Vijay V. |
| Jul-1990 | On-line Algorithms for Weighted Matching and Stable Marriages | Khuller, Samir; Mitchell, Stephen G.; Vazirani, Vijay V. |
| Nov-1987 | Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs | Vazirani, Vijay V.; Yannakakis, Mihali |
| Dec-1989 | Planar Graph Coloring is Not Self-Reducible Assuming $P \neq NP$ | Khuller, Samir; Vazirani, Vijay V. |
| Apr-1989 | Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph | Khuller, Samir; Mitchell, Stephen G.; Vazirani, Vijay V. |
| Dec-1988 | Random Polynomial Time is Equal to Semi-Random Polynomial Time | Vazirani, Umesh V.; Vazirani, Vijay V. |
| Sep-1989 | A Theory of Alternating Paths and Blossoms for Proving Correctness of the $O(\sqrt{VE})$ General Graph Matching Algorithm | Vazirani, Vijay V. |
| May-1989 | The Two-Processor Scheduling Problem is in Random NC | Vazirani, Umesh V.; Vazirani, Vijay V. |
Showing results 1 to 10 of 10
|
