Pages with the most revisions
Jump to navigation
Jump to search
Showing below up to 151 results in range #1 to #151.
View (previous 250 | next 250) (20 | 50 | 100 | 250 | 500)
- Basic graph definitions (140 revisions)
- Main Page (127 revisions)
- Depth-first search (119 revisions)
- Basic flow definitions (114 revisions)
- Algorithms and correctness (109 revisions)
- Preflow-push (106 revisions)
- Ahuja-Orlin (100 revisions)
- Hungarian method (98 revisions)
- Branching by Edmonds (93 revisions)
- Preflow-push with excess scaling (86 revisions)
- Basics of shortest paths (86 revisions)
- Classical bipartite cardinality matching (74 revisions)
- Successive shortest paths (65 revisions)
- Successive shortest paths with reduced costs (65 revisions)
- Max-Flow Problems (65 revisions)
- Breadth-first search (59 revisions)
- Pivot partitioning by scanning (57 revisions)
- Dijkstra (57 revisions)
- Matchings in graphs (52 revisions)
- Ford-Fulkerson (52 revisions)
- Negative cycle-canceling (50 revisions)
- Classical eulerian cycle algorithm (48 revisions)
- Quicksort (48 revisions)
- Asymptotic complexity of algorithms (45 revisions)
- Three indians' algorithm (45 revisions)
- Hopcroft-Karp (44 revisions)
- Edmonds-Karp (44 revisions)
- Asymptotic comparison of functions (42 revisions)
- Sets and sequences (41 revisions)
- Binary search tree (40 revisions)
- Kosaraju (38 revisions)
- B-tree (38 revisions)
- Binary search tree: insert (37 revisions)
- B-tree: find (34 revisions)
- Maximum matching by Edmonds (34 revisions)
- Binary search tree: remove (34 revisions)
- Blocking flow by Dinic (34 revisions)
- Hopcroft-Tarjan (33 revisions)
- Index handler (32 revisions)
- Directed Tree (31 revisions)
- Mergesort (31 revisions)
- B-tree: insert (31 revisions)
- FIFO preflow-push (30 revisions)
- Array list: remove (30 revisions)
- Binary search tree: find (28 revisions)
- Dinic (28 revisions)
- B-tree: remove (26 revisions)
- Kruskal for maximum spanning forest (26 revisions)
- Eulerian cycle (25 revisions)
- Binary search tree: remove node (24 revisions)
- Bucketsort (23 revisions)
- Sorted sequence (23 revisions)
- Binary search tree: traverse (21 revisions)
- Array list: insert at position (21 revisions)
- Ordered sequence (20 revisions)
- Merge (20 revisions)
- Maximum-weight matching (19 revisions)
- Dial implementation (19 revisions)
- Alternating paths algorithm (18 revisions)
- Min-cost flow problem (18 revisions)
- Bounded priority queue (18 revisions)
- Selection sort (18 revisions)
- Prim (18 revisions)
- Graph traversal (18 revisions)
- String matching based on finite automaton (17 revisions)
- Max-flow min-cut (17 revisions)
- Floyd-Warshall (16 revisions)
- Binary search (16 revisions)
- Bounded monotonous priority queue (15 revisions)
- Simple string matching algorithm (15 revisions)
- B-tree: insert and rearrange (15 revisions)
- Repeated depth-first search (14 revisions)
- Maximum branching (13 revisions)
- Union-find (13 revisions)
- B-tree: shift key to sibling (12 revisions)
- Bellman-Ford (12 revisions)
- Strongly connected components (12 revisions)
- Heap as array (12 revisions)
- All pairs shortest paths (12 revisions)
- Master theorem (12 revisions)
- Bubblesort (11 revisions)
- Array list: number (11 revisions)
- B-tree: merge two siblings (11 revisions)
- Cardinality-maximal matching (10 revisions)
- Lecture: Efficient Graph Algorithms (10 revisions)
- Index handler with list of unused (9 revisions)
- Union-find with lists (9 revisions)
- Array list (9 revisions)
- Bubble sort (9 revisions)
- Bubble (8 revisions)
- Linked list (8 revisions)
- Heap as array: ascendItem (8 revisions)
- B-tree: minimum (8 revisions)
- Heap as array: decrease key (8 revisions)
- Heap as array: descendItem (8 revisions)
- Blocking flow (8 revisions)
- Model computer (7 revisions)
- Sorting Sequences of Strings (7 revisions)
- B-tree: split (7 revisions)
- Sorting Algorithms (7 revisions)
- Doubly-linked list (7 revisions)
- Numbers (7 revisions)
- Maximum spanning forest (6 revisions)
- Biconnected components (6 revisions)
- Array list: find (6 revisions)
- Big O notation (6 revisions)
- Hashtable (6 revisions)
- Bipartite graph (5 revisions)
- Binary search tree: minimum (4 revisions)
- Quicksort in Place (4 revisions)
- Binary search tree: maximum (4 revisions)
- Sorting based on pairwise comparison (4 revisions)
- Pivot partioning (4 revisions)
- Heaps (4 revisions)
- Genericity (4 revisions)
- Single source shortest paths (4 revisions)
- One-dimensional string matching (3 revisions)
- Heap as array: extract minimum (3 revisions)
- Heap as array: insert (3 revisions)
- Finding an element in a sorted array (3 revisions)
- Exhaustive graph traversal (3 revisions)
- String matching (2 revisions)
- Problems on Sequences (2 revisions)
- Merging two sorted sequences (2 revisions)
- Path (2 revisions)
- Directed graph (2 revisions)
- Strings (2 revisions)
- Decision Tree (2 revisions)
- Union Find (2 revisions)
- Red-Black Tree (2 revisions)
- K-partite graph (1 revision)
- Shortest paths by repeated squaring (1 revision)
- Algorithmic problems (1 revision)
- Find an element in a sequence (1 revision)
- Union-find with disjoint trees (1 revision)
- Undirected tree (1 revision)
- Search tree (1 revision)
- Median (1 revision)
- Subgraph (1 revision)
- Multi-way search tree (1 revision)
- B-tree: maximum (1 revision)
- NP-complete problems (1 revision)
- L' Hospital (1 revision)
- Lower asymptotic bounds for algorithmic problems (1 revision)
- Minimum spanning tree (1 revision)
- Hash functions (1 revision)
- Fundamental types of algorithmic problems (1 revision)
- Encoded algorithmic problems (1 revision)
- Priority queue (1 revision)
- Single source single target shortest paths (1 revision)
- Insertion sort (1 revision)