R
Robert E. Tarjan
Researcher at Princeton University
Publications - 408
Citations - 70538
Robert E. Tarjan is an academic researcher from Princeton University. The author has contributed to research in topics: Time complexity & Spanning tree. The author has an hindex of 114, co-authored 400 publications receiving 67305 citations. Previous affiliations of Robert E. Tarjan include AT&T & Massachusetts Institute of Technology.
Papers
More filters
Journal ArticleDOI
An O(m log n) -time algorithm for the maximal planar subgraph problem
TL;DR: An O(m\log n) time algorithm to find a maximal planar subgraph is developed based on a new version of the Hopcroft and Tarjan planarity testing algorithm.
Journal ArticleDOI
Unique Maximum Matching Algorithms
TL;DR: This work considers the problem of testing the uniqueness of maximum matchings, both in the unweighted and in the weighted case, and gives a modification of the first algorithm that tests whether a given graph has a unique f-factor, and finds it if it exists.
Journal ArticleDOI
Short encodings of evolving structures
TL;DR: A derivation in a transformational system such as a graph grammar may be redundant in the sense that the exact order of the transformations may not affect the final outcome; all that matters is that each transformation, when applied, is applied to the correct substructure.
Book ChapterDOI
Finding dominators in practice
Loukas Georgiadis,Renato F. Werneck,Robert E. Tarjan,Robert E. Tarjan,Spyridon Triantafyllis,David I. August +5 more
TL;DR: An experimental study comparing two versions of a fast algorithm for finding dominators with careful implementations of both versions of the Lengauer-Tarjan algorithm and with a new hybrid algorithm suggests that, although the performance of all the algorithms is similar, the most consistently fast are the simple Leng Bauer-Tarjar algorithm and the hybrid algorithm, and their advantage increases as the graph gets bigger or more complicated.
Journal ArticleDOI
Complexity of combinatorial algorithms
TL;DR: This paper examines recent work on the complexity of combinatorial algorithms, highlighting the aims of the work, the mathematical tools used, and the important results.