( en | de | ru )

 

Disambiguation of "Tarjan, Robert Endre"

Author of the publication

copydeleteadd this publication to your clipboard
Graph Clustering and Minimum Cut Trees.

, , and . Internet Math., 1 (4): 385-408 (2003)

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.

Endre Komlos

Endre Palatinus

Endre Mészáros

Endre Bangerter

Endre Hagenthurn

 

Other publications of authors with the same name

Dynamic trees in practice., and . ACM Journal of Experimental Algorithmics, (2009)Data structures for mergeable trees., , , , and . ACM Trans. Algorithms, 7 (2): 14:1-14:30 (2011)Deletion without rebalancing in multiway search trees., and . ACM Trans. Database Syst., 39 (1): 8:1-8:14 (2014)Storing a Sparse Table., and . Commun. ACM, 22 (11): 606-611 (1979)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).Randomized parallel algorithms for trapezoidal diagrams., , and . Int. J. Comput. Geom. Appl., 2 (2): 117-133 (1992)