The following pages link to Robert Endre Tarjan (Q598808):
Displaying 50 items.
- (Q251062) (redirect page) (← links)
- A class of algorithms which require nonlinear time to maintain disjoint sets (Q598809) (← links)
- More efficient bottom-up multi-pattern matching in trees (Q685356) (← links)
- A simple version of Karzanov's blocking flow algorithm (Q795064) (← links)
- Simplified linear-time Jordan sorting and polygon clipping (Q911762) (← links)
- Finding a feasible flow in a strongly connected network (Q1003481) (← links)
- Notes on introductory combinatorics (Q1031093) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- A linear time solution to the single function coarsest partition problem (Q1063420) (← links)
- Sequential access in splay trees takes linear time (Q1072706) (← links)
- Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168) (← links)
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (Q1086246) (← links)
- A linear-time algorithm for finding a minimum spanning pseudoforest (Q1098629) (← links)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← links)
- The analysis of a nested dissection algorithm (Q1103322) (← links)
- The space complexity of pebble games on trees (Q1147515) (← links)
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) (← links)
- Finding minimum-cost flows by double scaling (Q1184348) (← links)
- Maintaining bridge-connected and biconnected components on-line (Q1186782) (← links)
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
- A new algorithm for finding weak components (Q1214260) (← links)
- A good algorithm for edge-disjoint branching (Q1214942) (← links)
- Edge-disjoint spanning trees and depth-first search (Q1217713) (← links)
- Testing flow graph reducibility (Q1221484) (← links)
- (Q1223158) (redirect page) (← links)
- Optimal chain partitions of trees (Q1223159) (← links)
- Computing an st-numbering (Q1231771) (← links)
- Lower bounds on the lengths of node sequences in directed graphs (Q1233875) (← links)
- Triangulating a simple polygon (Q1249042) (← links)
- A linear-time algorithm for finding all feedback vertices (Q1250830) (← links)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas (Q1254112) (← links)
- Time-space trade-offs in a pebble game (Q1254254) (← links)
- A parallel algorithm for finding a blocking flow in an acyclic network (Q1263969) (← links)
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
- Time bounds for selection (Q1394121) (← links)
- Minimum-cost flows in unit-capacity networks (Q1693987) (← links)
- A fast Las Vegas algorithm for triangulating a simple polygon (Q1823686) (← links)
- Updating a balanced search tree in 0(1) rotations (Q1838042) (← links)
- An improved algorithm for hierarchical clustering using strong components (Q1838311) (← links)
- A note on finding the bridges of a graph (Q1844076) (← links)
- Lazy structure sharing for query optimization (Q1892716) (← links)
- Dominating sets in planar graphs (Q1922883) (← links)
- Concurrent disjoint set union (Q2064053) (← links)
- The CB tree: a practical concurrent self-adjusting search tree (Q2256968) (← links)
- A V log V algorithm for isomorphism of triconnected planar graphs (Q2264677) (← links)
- Splaying preorders and postorders (Q2285113) (← links)
- Zip trees (Q2285118) (← links)
- Optimal parallel verification of minimum spanning trees in logarithmic time (Q2365173) (← links)
- Server allocation algorithms for tiered systems (Q2384784) (← links)
