Author of the publication

The complexity of finding maximum disjoint paths with length constraints.

, , and . Networks, 12 (3): 277-286 (1982)

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

Fast Canonization of Circular Strings.. J. Algorithms, 2 (2): 107-121 (1981)An O(log n) Parallel Connectivity Algorithm., and . J. Algorithms, 3 (1): 57-67 (1982)Efficient Optimization of Monotonic Functions on Trees., and . CAAP, volume 112 of Lecture Notes in Computer Science, page 332-339. Springer, (1981)An O(n² log n) Parallel MAX-FLOW Algorithm., and . J. Algorithms, 3 (2): 128-146 (1982)The complexity of finding maximum disjoint paths with length constraints., , and . Networks, 12 (3): 277-286 (1982)A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality., and . SIAM J. Comput., 9 (4): 827-845 (1980)Finding Euler Circuits in Logarithmic Parallel Time, , and . STOC, page 249-257. ACM, (1984)Finding the maximum, merging and sorting in a parallel computation model., and . CONPAR, volume 111 of Lecture Notes in Computer Science, page 314-327. Springer, (1981)Using Linear Programming Techniques for Scheduling-Based Random Test-Case Generation., , and . Haifa Verification Conference, volume 4383 of Lecture Notes in Computer Science, page 16-33. Springer, (2006)A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality, and . FOCS, page 205-217. IEEE Computer Society, (1979)