Author of the publication

A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity

, , , and . SCT, page 27-33. IEEE Computer Society, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Finding the Edge Connectivity of Directed Graphs., and . J. Algorithms, 10 (1): 76-85 (1989)Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality., , , , and . J. Algorithms, 19 (1): 116-143 (1995)Throughput maximization of real-time scheduling with batching., , , , , and . SODA, page 742-751. ACM/SIAM, (2002)Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications., , , and . ISTCS, page 78-88. IEEE Computer Society, (1996)Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings., and . PODC, page 282-292. ACM, (1986)Improved Selection on Totally Monotone Arrays., , and . FSTTCS, volume 560 of Lecture Notes in Computer Science, page 347-359. Springer, (1991)On finding most uniform spanning trees., and . Discret. Appl. Math., 20 (2): 173-175 (1988)A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph., and . Discret. Appl. Math., 73 (1): 27-34 (1997)All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns., , , , , , , and . IPCO, volume 7801 of Lecture Notes in Computer Science, page 13-24. Springer, (2013)Fast Geometric Approximation Techniques and Geometric Embedding Problems., , , and . Theor. Comput. Sci., 106 (2): 265-281 (1992)