The following pages link to Robert Endre Tarjan (Q598808):
Displaying 21 items.
- Decomposition by clique separators (Q1062072) (← links)
- Sequential access in splay trees takes linear time (Q1072706) (← links)
- Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168) (← links)
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
- Applications of Path Compression on Balanced Trees (Q3048273) (← links)
- Finding Minimum-Cost Circulations by Successive Approximation (Q3351112) (← links)
- Faster algorithms for the shortest path problem (Q3474275) (← links)
- Finding minimum-cost circulations by canceling negative cycles (Q3474897) (← links)
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (Q3675541) (← links)
- Worst-case Analysis of Set Union Algorithms (Q3769963) (← links)
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon (Q3777450) (← links)
- Maintenance of a minimum spanning forest in a dynamic plane graph (Q3990614) (← links)
- Algorithmic Aspects of Vertex Elimination on Graphs (Q4124209) (← links)
- A Combinatorial Problem Which Is Complete in Polynomial Space (Q4127387) (← links)
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs (Q4268849) (← links)
- A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals (Q4943850) (← links)
- Enumeration of the Elementary Circuits of a Directed Graph (Q5181391) (← links)
- Strict fibonacci heaps (Q5415543) (← links)
- Depth-First Search and Linear Graph Algorithms (Q5663889) (← links)
- Rank-Pairing Heaps (Q5895541) (← links)
