Slides (PDF)

More documents

Recommendations

Info

Candidate 1 Observation The level number of a vertex is a tree isomorphism invariant. Conjecture Two trees are isomorphic if and only if they have the same number of levels and the same number of vertices on each level. Observation The number of the leaves is a tree isomorphism invariant. 8 / 22
Candidate 1 Observation The level number of a vertex is a tree isomorphism invariant. Conjecture Two trees are isomorphic if and only if they have the same number of levels and the same number of vertices on each level. Observation The number of the leaves is a tree isomorphism invariant. Contrary instance a T 1 1 2 · · · n 1 2 · · · n T 2 d e D E 8 / 22 A
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: Candidate 1 Observation The level n
Page 33 and 34: Candidate 2 What’s wrong with can
Page 35 and 36: Candidate 2 (part 2) Observation Si
Page 37 and 38: Candidate 3 Conjecture Two trees ar
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
show all

Slides (PDF)

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

Delete template?

Save as template?