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
Book ChapterDOI
Rank-Pairing Heaps
TL;DR: The rank-pairing heap is introduced, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pairing heaps.
Posted Content
Incremental Topological Ordering and Strong Component Maintenance
TL;DR: An on-line algorithm for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created, which takes O(m^{1/2}) amortized time per arc.
Journal ArticleDOI
Erratum: "randomized parallel algorithms for trapezoidal diagrams"
Book
A linear time algorithm for finding an ambitus
TL;DR: A linear-time algorithm for finding an ambitus, a cycle in a graph containing two distinguished vertices such that certain different groups of bridges satisfy the property that a bridge in one group does not interlace with any bridge in the other groups, is devised.
Proceedings ArticleDOI
Efficient algorithms for simple matroid intersection problems
Harold N. Gabow,Robert E. Tarjan +1 more
TL;DR: An algorithm is given for finding a minimum spanning tree on a directed graph, where the given root r has prespecified degree; the time is O(m log n), the same as for the problem without the degree constraint.