Slides (PDF)

More documents

Recommendations

Info

Candidate 2 (part 2) Observation Since a tree isomorphism preserves longest paths from the root, the number of levels in a tree is a tree isomorphism invariant. Contrary instance a A b c B C d e 1 D E T 1 T 2 10 / 22 1 . . n n
Candidate 3 Conjecture Two trees are isomorphic if and only if they have the same degree spectrum at each level. 11 / 22
Page 1 and 2: Tree isomorphism Alexander Smal St.
Page 3 and 4: Graph isomorphism Definition Isomor
Page 5 and 6: Graph isomorphism Definition Isomor
Page 7 and 8: Rooted trees Definition Rooted tree
Page 13 and 14: Rooted trees (part 2) Lemma If ther
Page 19 and 20: Diameter and center Definition The
Page 21 and 22: Diameter and center Definition The
Page 23 and 24: The idea Let’s try to find comple
Page 29 and 30: Candidate 1 Observation The level n
Page 31 and 32: Candidate 1 Observation The level n
Page 33 and 34: Candidate 2 What’s wrong with can
Page 35: Candidate 2 (part 2) Observation Si
Page 39 and 40: Candidate 3 Conjecture Two trees ar
Page 41 and 42: Algorithm by Aho, Hopcroft and Ullm
Page 43 and 44: Algorithm by Aho, Hopcroft and Ullm
Page 45 and 46: Understanding AHU algorithm Knuth t
Page 57 and 58: Understanding AHU algorithm (part 3
Page 67 and 68: AHU algorithm improvement Observati
Page 73 and 74: AHU algorithm example Example A a B
Page 79 and 80: AHU algorithm example Example A 1 2
Page 81 and 82: AHU algorithm example Example A 1 a
Page 83 and 84: Resume Resume • We have three uns

Slides (PDF)

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?