advanced algorithms coms31900 lowest common ancestor
play

Advanced Algorithms COMS31900 Lowest Common Ancestor (with a bit - PowerPoint PPT Presentation

Jan 12, 2024 •198 likes •1.9k views

Advanced Algorithms COMS31900 Lowest Common Ancestor (with a bit on on Range Minimum Queries) Rapha el Clifford Slides by Benjamin Sach Advanced Algorithms COMS31900 Lowest Common Ancestor (with a bit on on Range Minimum Queries)

  1. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 (depth) D 0 1 2 3 2 3 2 1 2 1

  2. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 (depth) D 0 1 2 3 2 3 2 1 2 1 0

  3. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1

  4. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0

  5. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1

  6. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2

  7. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1

  8. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2

  9. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1

  10. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0

  11. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1

  12. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0

  13. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 How long is the tour? 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0

  14. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 How long is the tour? We follow each edge twice. . . and there are ( n − 1) edges 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0

  15. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 How long is the tour? We follow each edge twice. . . and there are ( n − 1) edges 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0

  16. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 How long is the tour? We follow each edge twice. . . i j and there are ( n − 1) edges 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 how do we find LCA(i,j)?

  17. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 How long is the tour? We follow each edge twice. . . i j and there are ( n − 1) edges 9 10 3 Find i and j in N (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 how do we find LCA(i,j)?

  18. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 How long is the tour? We follow each edge twice. . . i j and there are ( n − 1) edges 9 10 3 Find i and j in N (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 i ′ j ′ how do we find LCA(i,j)?

  19. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 How long is the tour? We follow each edge twice. . . i j and there are ( n − 1) edges 9 10 3 Find i and j in N (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 i ′ j ′ Compute RMQ ( i ′ , j ′ ) in D how do we find LCA(i,j)?

  20. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 How long is the tour? We follow each edge twice. . . i j and there are ( n − 1) edges 9 10 3 Find i and j in N (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 i ′ j ′ Compute RMQ ( i ′ , j ′ ) in D how do we find LCA(i,j)?

  21. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 How long is the tour? We follow each edge twice. . . and there are ( n − 1) edges 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 how do we find LCA(i,j)?

  22. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 How long is the tour? j i We follow each edge twice. . . and there are ( n − 1) edges 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 how do we find LCA(i,j)?

  23. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 How long is the tour? j i We follow each edge twice. . . and there are ( n − 1) edges 9 10 3 Find i and j in N (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 how do we find LCA(i,j)?

  24. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 How long is the tour? j i We follow each edge twice. . . and there are ( n − 1) edges 9 10 3 Find i and j in N (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 i ′ j ′ how do we find LCA(i,j)?

  25. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 How long is the tour? j i We follow each edge twice. . . and there are ( n − 1) edges 9 10 3 Find i and j in N (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 i ′ j ′ Compute RMQ ( i ′ , j ′ ) in D how do we find LCA(i,j)?

  26. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 How long is the tour? j i We follow each edge twice. . . and there are ( n − 1) edges 9 10 3 Find i and j in N (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 1 0 1 0 1 2 1 2 1 0 1 0 i ′ j ′ Compute RMQ ( i ′ , j ′ ) in D how do we find LCA(i,j)?

  27. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit . . . and its depth 6 7 8 5 2 How long is the tour? We follow each edge twice. . . and there are ( n − 1) edges 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 how do we find LCA(i,j)?

  28. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit j i . . . and its depth 6 7 8 5 2 How long is the tour? We follow each edge twice. . . and there are ( n − 1) edges 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 how do we find LCA(i,j)?

  29. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit j i . . . and its depth 6 7 8 5 2 How long is the tour? We follow each edge twice. . . and there are ( n − 1) edges 9 10 3 Find i and j in N . . . (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 how do we find LCA(i,j)?

  30. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit j i . . . and its depth 6 7 8 5 2 How long is the tour? We follow each edge twice. . . and there are ( n − 1) edges 9 10 3 Find i and j in N . . . which copy of i ? (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 how do we find LCA(i,j)?

  31. Solving LCAs using RMQs 0 0 Compute an Euler tour of T . . . (a depth first search with repeats) 4 1 3 1 2 Write down every node you visit j i . . . and its depth 6 7 8 5 2 How long is the tour? We follow each edge twice. . . and there are ( n − 1) edges 9 10 3 Find i and j in N . . . which copy of i ? any copy is fine (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 how do we find LCA(i,j)?

  32. Solving LCAs using RMQs 0 0 4 1 3 1 2 6 7 8 5 2 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0

  33. Solving LCAs using RMQs 0 0 Preprocessing Summary 1. Construct N and D from T 2. Add a pointer from each node i to some N [ i ′ ] = i 4 1 3 1 2 3. Preprocess D for RMQs 6 7 8 5 2 9 10 3 (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0

  34. Solving LCAs using RMQs 0 0 Preprocessing Summary 1. Construct N and D from T 2. Add a pointer from each node i to some N [ i ′ ] = i 4 1 3 1 2 3. Preprocess D for RMQs 6 7 8 5 2 Query Summary - LCA(i,j) 1. Find (any) i ′ st. N [ i ′ ] = i 2. Find (any) j ′ st. N [ j ′ ] = j 9 10 3. Compute RMQ ( i ′ , j ′ ) in D 3 4. LCA ( i, j ) = N [ RMQ ( i ′ , j ′ )] (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0

  35. Solving LCAs using RMQs 0 0 Preprocessing Summary O ( n ) 1. Construct N and D from T 2. Add a pointer from each node i to some N [ i ′ ] = i 4 1 3 1 2 3. Preprocess D for RMQs 6 7 8 5 2 Query Summary - LCA(i,j) 1. Find (any) i ′ st. N [ i ′ ] = i 2. Find (any) j ′ st. N [ j ′ ] = j 9 10 3. Compute RMQ ( i ′ , j ′ ) in D 3 4. LCA ( i, j ) = N [ RMQ ( i ′ , j ′ )] (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0

  36. Solving LCAs using RMQs 0 0 Preprocessing Summary O ( n ) 1. Construct N and D from T O ( n ) 2. Add a pointer from each node i to some N [ i ′ ] = i 4 1 3 1 2 3. Preprocess D for RMQs 6 7 8 5 2 Query Summary - LCA(i,j) 1. Find (any) i ′ st. N [ i ′ ] = i 2. Find (any) j ′ st. N [ j ′ ] = j 9 10 3. Compute RMQ ( i ′ , j ′ ) in D 3 4. LCA ( i, j ) = N [ RMQ ( i ′ , j ′ )] (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0

  37. Solving LCAs using RMQs 0 0 Preprocessing Summary O ( n ) 1. Construct N and D from T O ( n ) 2. Add a pointer from each node i to some N [ i ′ ] = i 4 1 3 1 2 O (?) 3. Preprocess D for RMQs 6 7 8 5 2 Query Summary - LCA(i,j) 1. Find (any) i ′ st. N [ i ′ ] = i 2. Find (any) j ′ st. N [ j ′ ] = j 9 10 3. Compute RMQ ( i ′ , j ′ ) in D 3 4. LCA ( i, j ) = N [ RMQ ( i ′ , j ′ )] (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0

  38. Solving LCAs using RMQs 0 0 Preprocessing Summary O ( n ) 1. Construct N and D from T O ( n ) 2. Add a pointer from each node i to some N [ i ′ ] = i 4 1 3 1 2 O (?) 3. Preprocess D for RMQs 6 7 8 5 2 Query Summary - LCA(i,j) 1. Find (any) i ′ st. N [ i ′ ] = i O (1) 2. Find (any) j ′ st. N [ j ′ ] = j 9 10 3. Compute RMQ ( i ′ , j ′ ) in D 3 4. LCA ( i, j ) = N [ RMQ ( i ′ , j ′ )] (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0

  39. Solving LCAs using RMQs 0 0 Preprocessing Summary O ( n ) 1. Construct N and D from T O ( n ) 2. Add a pointer from each node i to some N [ i ′ ] = i 4 1 3 1 2 O (?) 3. Preprocess D for RMQs 6 7 8 5 2 Query Summary - LCA(i,j) 1. Find (any) i ′ st. N [ i ′ ] = i O (1) 2. Find (any) j ′ st. N [ j ′ ] = j O (1) 9 10 3. Compute RMQ ( i ′ , j ′ ) in D 3 4. LCA ( i, j ) = N [ RMQ ( i ′ , j ′ )] (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0

  40. Solving LCAs using RMQs 0 0 Preprocessing Summary O ( n ) 1. Construct N and D from T O ( n ) 2. Add a pointer from each node i to some N [ i ′ ] = i 4 1 3 1 2 O (?) 3. Preprocess D for RMQs 6 7 8 5 2 Query Summary - LCA(i,j) 1. Find (any) i ′ st. N [ i ′ ] = i O (1) 2. Find (any) j ′ st. N [ j ′ ] = j O (1) 9 10 O (?) 3. Compute RMQ ( i ′ , j ′ ) in D 3 4. LCA ( i, j ) = N [ RMQ ( i ′ , j ′ )] (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0

  41. Solving LCAs using RMQs 0 0 Preprocessing Summary O ( n ) 1. Construct N and D from T O ( n ) 2. Add a pointer from each node i to some N [ i ′ ] = i 4 1 3 1 2 O (?) 3. Preprocess D for RMQs 6 7 8 5 2 Query Summary - LCA(i,j) 1. Find (any) i ′ st. N [ i ′ ] = i O (1) 2. Find (any) j ′ st. N [ j ′ ] = j O (1) 9 10 O (?) 3. Compute RMQ ( i ′ , j ′ ) in D 3 O (1) 4. LCA ( i, j ) = N [ RMQ ( i ′ , j ′ )] (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0

  42. Solving LCAs using RMQs 0 0 Preprocessing Summary O ( n ) 1. Construct N and D from T O ( n ) 2. Add a pointer from each node i to some N [ i ′ ] = i 4 1 3 1 2 O (?) 3. Preprocess D for RMQs 6 7 8 5 2 Query Summary - LCA(i,j) 1. Find (any) i ′ st. N [ i ′ ] = i O (1) 2. Find (any) j ′ st. N [ j ′ ] = j O (1) 9 10 O (?) 3. Compute RMQ ( i ′ , j ′ ) in D 3 O (1) 4. LCA ( i, j ) = N [ RMQ ( i ′ , j ′ )] (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 Prep. time O ( n + prepRMQ ( n )) Space O ( n + spaceRMQ ( n )) Query time O (1 + queryRMQ ( n )) depends on the RMQ structure used

  43. Solving LCAs using RMQs 0 0 Preprocessing Summary O ( n ) 1. Construct N and D from T O ( n ) 2. Add a pointer from each node i to some N [ i ′ ] = i 4 1 3 1 2 O (?) 3. Preprocess D for RMQs 6 7 8 5 2 Query Summary - LCA(i,j) 1. Find (any) i ′ st. N [ i ′ ] = i O (1) 2. Find (any) j ′ st. N [ j ′ ] = j O (1) 9 10 O (?) 3. Compute RMQ ( i ′ , j ′ ) in D 3 O (1) 4. LCA ( i, j ) = N [ RMQ ( i ′ , j ′ )] (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 Prep. time O ( n log log n ) Space O ( n log log n ) Query time O (1) using the best result from last lecture

  44. Solving LCAs using RMQs 0 0 Preprocessing Summary O ( n ) 1. Construct N and D from T O ( n ) 2. Add a pointer from each node i to some N [ i ′ ] = i 4 1 3 1 2 O (?) 3. Preprocess D for RMQs 6 7 8 5 2 Query Summary - LCA(i,j) 1. Find (any) i ′ st. N [ i ′ ] = i O (1) 2. Find (any) j ′ st. N [ j ′ ] = j O (1) 9 10 O (?) 3. Compute RMQ ( i ′ , j ′ ) in D 3 O (1) 4. LCA ( i, j ) = N [ RMQ ( i ′ , j ′ )] why does this work? (node) N 0 1 5 9 5 10 5 1 6 1 0 2 0 3 7 3 8 3 0 4 0 2 n − 1 (depth) D 0 1 2 3 2 3 2 1 2 1 0 1 0 1 2 1 2 1 0 1 0 Prep. time O ( n log log n ) Space O ( n log log n ) Query time O (1) using the best result from last lecture

  45. Solving LCA using RMQ - correctness We can also define a Euler tour of T recursively. . . x depth = d depth = d + 1 depth > d + 1 S 1 S 2 S 3 S k (node) N x x x x x x (depth) D d d d d d d

  46. Solving LCA using RMQ - correctness We can also define a Euler tour of T recursively. . . x depth = d children depth = d + 1 depth > d + 1 S 1 S 2 S 3 S k (node) N x x x x x x (depth) D d d d d d d

  47. Solving LCA using RMQ - correctness We can also define a Euler tour of T recursively. . . x depth = d children depth = d + 1 depth > d + 1 S 1 S 2 S 3 S k subtrees (node) N x x x x x x (depth) D d d d d d d

  48. Solving LCA using RMQ - correctness We can also define a Euler tour of T recursively. . . x depth = d children depth = d + 1 depth > d + 1 S 1 S 2 S 3 S k subtrees (node) N x x x x x x (depth) D d d d d d d tour of S 1 tour of S 2 tour of S 3 tour of S k

  49. Solving LCA using RMQ - correctness We can also define a Euler tour of T recursively. . . x depth = d depth = d + 1 depth > d + 1 S 1 S 2 S 3 S k (node) N x x x x x x (depth) D d d d d d d tour of S 1 tour of S 2 tour of S 3 tour of S k

  50. Solving LCA using RMQ - correctness We can also define a Euler tour of T recursively. . . x depth = d depth = d + 1 y depth > d + 1 S 1 S 3 S k y y y y (node) N x x x x x x (depth) D d d d d d d d + 1 d + 1 d + 1 d + 1 tour of S 1 tour of S 2 tour of S 3 tour of S k

  51. Solving LCA using RMQ - correctness We can also define a Euler tour of T recursively. . . x depth = d depth = d + 1 y depth > d + 1 S 1 S 3 S k y y y y (node) N x x x x x x (depth) D d d d d d d d + 1 d + 1 d + 1 d + 1 tour of S 1 tour of S 2 tour of S 3 tour of S k

  52. Solving LCA using RMQ - correctness We can also define a Euler tour of T recursively. . . Claim the RMQ reports the location of x depth = d some y in N iff LCA ( i, j ) = y depth = d + 1 y depth > d + 1 S 1 S 3 S k y y y y (node) N x x x x x x (depth) D d d d d d d d + 1 d + 1 d + 1 d + 1 tour of S 1 tour of S 2 tour of S 3 tour of S k

  53. Solving LCA using RMQ - correctness We can also define a Euler tour of T recursively. . . Claim the RMQ reports the location of x depth = d some y in N iff LCA ( i, j ) = y depth = d + 1 y depth > d + 1 S 1 S 3 S k i j y y y y (node) N x x x x x x (depth) D d d d d d d d + 1 d + 1 d + 1 d + 1 tour of S 1 tour of S 2 tour of S 3 tour of S k

  54. Solving LCA using RMQ - correctness We can also define a Euler tour of T recursively. . . Claim the RMQ reports the location of x depth = d some y in N iff LCA ( i, j ) = y depth = d + 1 y depth > d + 1 S 1 S 3 S k i j imagine LCA ( i, j ) is not y y y y y (node) N x x x x x x (depth) D d d d d d d d + 1 d + 1 d + 1 d + 1 tour of S 1 tour of S 2 tour of S 3 tour of S k

  55. Solving LCA using RMQ - correctness We can also define a Euler tour of T recursively. . . Claim the RMQ reports the location of x depth = d some y in N iff LCA ( i, j ) = y depth = d + 1 y depth > d + 1 S 1 S 3 S k i j imagine LCA ( i, j ) is not y i ′ and j ′ are in here so RMQ does not return the location of a y y y y y (node) N x x x x x x (depth) D d d d d d d d + 1 d + 1 d + 1 d + 1 tour of S 1 tour of S 2 tour of S 3 tour of S k

  56. Solving LCA using RMQ - correctness We can also define a Euler tour of T recursively. . . Claim the RMQ reports the location of x depth = d some y in N iff LCA ( i, j ) = y depth = d + 1 y depth > d + 1 S 1 S 3 S k i j imagine LCA ( i, j ) is not y i ′ and j ′ are in here so RMQ does not return the location of a y (all of the y s are out of range) y y y y (node) N x x x x x x (depth) D d d d d d d d + 1 d + 1 d + 1 d + 1 tour of S 1 tour of S 2 tour of S 3 tour of S k

  57. Solving LCA using RMQ - correctness We can also define a Euler tour of T recursively. . . Claim the RMQ reports the location of x depth = d some y in N iff LCA ( i, j ) = y depth = d + 1 y depth > d + 1 S 1 S 3 S k y y y y (node) N x x x x x x (depth) D d d d d d d d + 1 d + 1 d + 1 d + 1 tour of S 1 tour of S 2 tour of S 3 tour of S k

  58. Solving LCA using RMQ - correctness We can also define a Euler tour of T recursively. . . Claim the RMQ reports the location of x depth = d some y in N iff LCA ( i, j ) = y depth = d + 1 y depth > d + 1 S 1 S 3 S k j i y y y y (node) N x x x x x x (depth) D d d d d d d d + 1 d + 1 d + 1 d + 1 tour of S 1 tour of S 2 tour of S 3 tour of S k

Recommend

Advanced Algorithms COMS31900 Approximation algorithms part two more constant factor

Advanced Algorithms COMS31900 Approximation algorithms part two more constant factor

Advanced Algorithms COMS31900 Approximation algorithms part two more constant factor approximations Rapha el Clifford Slides by Benjamin Sach Approximation Algorithms Recap An algorithm A is an -approximation algorithm for problem P

2.14k views • 175 slides
Advanced Algorithms COMS31900 Approximation algorithms part four Asymptotic Polynomial Time

Advanced Algorithms COMS31900 Approximation algorithms part four Asymptotic Polynomial Time

Advanced Algorithms COMS31900 Approximation algorithms part four Asymptotic Polynomial Time Approximation Schemes Rapha el Clifford Slides by Benjamin Sach Approximation Algorithms Recap A polynomial time algorithm A is an

1.52k views • 134 slides
Advanced Algorithms COMS31900 Approximation algorithms part three (Fully) Polynomial Time

Advanced Algorithms COMS31900 Approximation algorithms part three (Fully) Polynomial Time

Advanced Algorithms COMS31900 Approximation algorithms part three (Fully) Polynomial Time Approximation Schemes Rapha el Clifford Slides by Benjamin Sach Approximation Algorithms Recap An algorithm A is an -approximation algorithm for

1.72k views • 161 slides
Advanced Algorithms COMS31900 Hashing part one Chaining, true randomness and universal

Advanced Algorithms COMS31900 Hashing part one Chaining, true randomness and universal

Advanced Algorithms COMS31900 Hashing part one Chaining, true randomness and universal hashing Rapha el Clifford Slides by Benjamin Sach and Markus Jalsenius Dictionaries In a dictionary data structure we store ( key , value ) -pairs

1.56k views • 98 slides
Advanced Algorithms COMS31900 Hashing part three Cuckoo Hashing Rapha el Clifford Slides

Advanced Algorithms COMS31900 Hashing part three Cuckoo Hashing Rapha el Clifford Slides

Advanced Algorithms COMS31900 Hashing part three Cuckoo Hashing Rapha el Clifford Slides by Benjamin Sach Back to the start (again) A dynamic dictionary stores ( key , value ) -pairs and supports: add ( key , value ) , lookup ( key )

2.03k views • 163 slides
Advanced Algorithms COMS31900 Hashing part two Static Perfect Hashing Rapha el Clifford

Advanced Algorithms COMS31900 Hashing part two Static Perfect Hashing Rapha el Clifford

Advanced Algorithms COMS31900 Hashing part two Static Perfect Hashing Rapha el Clifford Slides by Benjamin Sach Dictionaries and Hashing recap A dynamic dictionary stores ( key , value ) -pairs and supports: add ( key , value ) ,

1.14k views • 99 slides
Exercise Sheet 1: Hashing and Bloom filters COMS31900 Advanced Algorithms 2019/2020 Please feel

Exercise Sheet 1: Hashing and Bloom filters COMS31900 Advanced Algorithms 2019/2020 Please feel

Exercise Sheet 1: Hashing and Bloom filters COMS31900 Advanced Algorithms 2019/2020 Please feel free to discuss these problems on the unit discussion board. If you would like to have your answers marked, please either hand them in in person at

361 views • 5 slides
Advanced Algorithms COMS31900 Orthogonal Range Searching Rapha el Clifford Slides by

Advanced Algorithms COMS31900 Orthogonal Range Searching Rapha el Clifford Slides by

Advanced Algorithms COMS31900 Orthogonal Range Searching Rapha el Clifford Slides by Benjamin Sach Orthogonal range searching A 2D range searching data structure stores n distinct ( x, y ) -pairs and supports: the lookup ( x 1 , x 2 ,

2.2k views • 187 slides
Advanced Algorithms COMS31900 Probability recap. Rapha el Clifford Slides by Markus

Advanced Algorithms COMS31900 Probability recap. Rapha el Clifford Slides by Markus

Advanced Algorithms COMS31900 Probability recap. Rapha el Clifford Slides by Markus Jalsenius Randomness and probability Probability The sample space S is the set of outcomes of an experiment. Probability The sample space S is the set

1.48k views • 110 slides
Range Minimum and Lowest Common Ancestor Queries Slides by Solon P. Pissis November 15, 2019

Range Minimum and Lowest Common Ancestor Queries Slides by Solon P. Pissis November 15, 2019

Range Minimum and Lowest Common Ancestor Queries Slides by Solon P. Pissis November 15, 2019 RMQs and LCA queries Range Minimum Queries problem RMQs and LCA queries Range Minimum Queries problem Definition Given an array A [1 . . . n ],

1.42k views • 88 slides
Evolution and Population Genetics 02-715 Advanced Topics in Computa8onal

Evolution and Population Genetics 02-715 Advanced Topics in Computa8onal

Evolution and Population Genetics 02-715 Advanced Topics in Computa8onal Genomics A Human Coalescence at the most recent common ancestor Genealogy Coalescence in Population Genetics

384 views • 24 slides
Beyond the Lowest Common Denominator Designing Effective Digital Resources Paul Vetch 18/03/12

Beyond the Lowest Common Denominator Designing Effective Digital Resources Paul Vetch 18/03/12

Beyond the Lowest Common Denominator Designing Effective Digital Resources Paul Vetch 18/03/12 Tensions Users, audiences (and production value) Ubiquity and Trends Experimentation (and failure) Sustainability (and The

613 views • 33 slides
Advanced Algorithms (I) Chihao Zhang Shanghai Jiao Tong University Feb. 25, 2019 Advanced

Advanced Algorithms (I) Chihao Zhang Shanghai Jiao Tong University Feb. 25, 2019 Advanced

Advanced Algorithms (I) Chihao Zhang Shanghai Jiao Tong University Feb. 25, 2019 Advanced Algorithms (I) 1/14 Advanced Algorithms In the course, we will learn Approximation Algorithms linear programming, semi-definite programming spectral

646 views • 64 slides
Week 7 Video 3 Advanced Clustering Algorithms Today Multiple advanced algorithms for

Week 7 Video 3 Advanced Clustering Algorithms Today Multiple advanced algorithms for

Week 7 Video 3 Advanced Clustering Algorithms Today Multiple advanced algorithms for clustering Gaussian Mixture Models Often called EM-based clustering Kind of a misnomer in my opinion What distinguishes this algorithm

681 views • 21 slides
On Cartesian Trees, Lowest Common Ancestors, and Range Minimum Queries 0 2 0 4 3 5 1 7 6

On Cartesian Trees, Lowest Common Ancestors, and Range Minimum Queries 0 2 0 4 3 5 1 7 6

On Cartesian Trees, Lowest Common Ancestors, and Range Minimum Queries 0 2 0 4 3 5 1 7 6 1 2 min? 3 6 4 5 7 LCA? Parallel Computing Day Ben-Gurion University Tuesday, October 20, 2009 RMQ 2 0 4 3 5 1 7 6 Tuesday,

1.37k views • 108 slides
Advanced Algorithms (IV) Chihao Zhang Shanghai Jiao Tong University Mar. 18, 2019 Advanced

Advanced Algorithms (IV) Chihao Zhang Shanghai Jiao Tong University Mar. 18, 2019 Advanced

Advanced Algorithms (IV) Chihao Zhang Shanghai Jiao Tong University Mar. 18, 2019 Advanced Algorithms (IV) 1/11 Review n u v E w T u w v s.t. w u u max V w T u w u u V Advanced Algorithms (IV) e Vector Program MaxCut Integer

606 views • 39 slides
You are invited to an Ancestor Fair Saturday, August 22, 2015 Public viewing of exhibits 11 AM-3

You are invited to an Ancestor Fair Saturday, August 22, 2015 Public viewing of exhibits 11 AM-3

You are invited to an Ancestor Fair Saturday, August 22, 2015 Public viewing of exhibits 11 AM-3 PM At the Ponca City Senior Center 319 W. Grand Ave. Ponca City, OK 74601 Exhibitor Information for Ancestor Fair as of 5/7/2015 Ancestor

277 views • 16 slides
CS310 - Advanced Data Structures and Algorithms Fall 2016 Algorithmic Techniques October 2,

CS310 - Advanced Data Structures and Algorithms Fall 2016 Algorithmic Techniques October 2,

CS310 - Advanced Data Structures and Algorithms Fall 2016 Algorithmic Techniques October 2, 2016 Algorithmic Techniques Common techniques to solve various problems. Divide and conquer Backtracking Greedy algorithms Dynamic programming

739 views • 41 slides
Divide and Conquer Algorithms: Advanced Sorting Prichard Ch. 10.2: Advanced Sorting Algorithms

Divide and Conquer Algorithms: Advanced Sorting Prichard Ch. 10.2: Advanced Sorting Algorithms

Divide and Conquer Algorithms: Advanced Sorting Prichard Ch. 10.2: Advanced Sorting Algorithms 1 Sorting Algorithm n Organize a collection of data into either ascending or descending order. n Internal sort q Collection of data fits entirely in

573 views • 42 slides
Advanced Algorithms LP-based Algorithms LP rounding: Relax the

Advanced Algorithms LP-based Algorithms LP rounding: Relax the

Advanced Algorithms LP-based Algorithms LP rounding: Relax the integer program to LP; round the optimal LP solution to a nearby feasible integral solution. The primal-dual schema: Find a pair of

653 views • 38 slides
Advanced Algorithms (II) Chihao Zhang Shanghai Jiao Tong University Mar. 4, 2019 Advanced

Advanced Algorithms (II) Chihao Zhang Shanghai Jiao Tong University Mar. 4, 2019 Advanced

Advanced Algorithms (II) Chihao Zhang Shanghai Jiao Tong University Mar. 4, 2019 Advanced Algorithms (II) 1/11 We show that this ratio can also be achieved via direct rounding. Recall that we have the following linear programming relaxation.

513 views • 50 slides
ADVANCED ALGORITHMS Lecture 14: randomized algorithms 1 ANNOUNCEMENTS HW 3 out; due

ADVANCED ALGORITHMS Lecture 14: randomized algorithms 1 ANNOUNCEMENTS HW 3 out; due

ADVANCED ALGORITHMS Lecture 14: randomized algorithms 1 ANNOUNCEMENTS HW 3 out; due Friday after fall break Look out for project topics! announcement in a little while Groups of 2-3 Give a list of >= 5 topics, top choice

900 views • 23 slides
Whale Evolution 1 Whales and dolphins are mammals. They are some of the only mammals that live

Whale Evolution 1 Whales and dolphins are mammals. They are some of the only mammals that live

Whale Evolution 1 Whales and dolphins are mammals. They are some of the only mammals that live in water. 2 What do you think the ancestor of modern day whales were like? 3 If whales evolved from one common ancestor, what did it look like?

458 views • 31 slides
Advanced Algorithms (III) Chihao Zhang Shanghai Jiao Tong University Mar. 11, 2019 Advanced

Advanced Algorithms (III) Chihao Zhang Shanghai Jiao Tong University Mar. 11, 2019 Advanced

Advanced Algorithms (III) Chihao Zhang Shanghai Jiao Tong University Mar. 11, 2019 Advanced Algorithms (III) 1/11 Similar to Max2SAT, tossing a fair coin yields an MaxCut MaxCut Input: An undirected graph G V E . Problem: A set S V that

722 views • 46 slides

More recommend