Author of the publication

Efficient Algorithms for Graph Manipulation H (Algorithm 447).

, and . Commun. ACM, 16 (6): 372-378 (1973)

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

If Piracy Is the Problem, Is DRM the Answer?, , , , and . Digital Rights Management, volume 2770 of Lecture Notes in Computer Science, Springer, (2003)Fibonacci Heaps Revisited., , and . CoRR, (2014)Confluently Persistent Deques via Data Structural Bootstrapping., and . SODA, page 155-164. ACM/SIAM, (1993)Computing Minimal Spanning Subgraphs in Linear Time., , , and . SODA, page 146-156. ACM/SIAM, (1992)Results and Problems on Self-adjusting Search Trees and Related Data Structures.. SWAT, volume 4059 of Lecture Notes in Computer Science, page 2. Springer, (2006)Minimum Cost Flows in Graphs with Unit Capacities., , , and . STACS, volume 30 of LIPIcs, page 406-419. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Toward Efficient Unstructured Multigrid Preprocessing., , and . Int. J. High Perform. Comput. Appl., 11 (1): 12-33 (1997)Parallelism in multigrid methods: How much is too much?, and . Int. J. Parallel Program., 24 (5): 397-432 (1996)Short Encodings of Evolving Structures., , and . SIAM J. Discret. Math., 5 (3): 428-450 (1992)Correction: Space Bounds for a Game on Graphs., , and . Math. Syst. Theory, (1977)see: Mathematical Systems Theory 10: 239-251 (1977).