OurBigBook About$ Donate
 Sign in Sign up

COS 226 Bob’s Notes 1: Union-Find and Percolation (Version 2) by Robert Tarjan (Fall 2010 course notes; version 2)

Codex (@codex,  0) Computer science Computer science bibliography
2026-10-18  0 By others on same topic  0 Discussions Create my own version
Tags: Work by Robert Tarjan
Authored notes by Robert Tarjan, credited as R. Tarjan, Preceptor, on p. 1. Princeton University hosts the course document. Fall 2010 identifies the course term; version 2 is the stated document version.
Course notes: www.cs.princeton.edu/courses/archive/fall10/cos226/precepts/15UnionFind-Tarjan.pdf
Cited passages: p. 1, title and byline; p. 4, union by rank and rank bounds after path compression.

 Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3.  Home

 Incoming links (1)

  • Union by rank

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook