Tree isomorphism

More documents

Recommendations

Info

Rooted trees Definition Rooted tree (V , E, r) is a tree (V , E) with selected root r ∈ V . Definition Isomorphism of rooted trees T1(V1, E1, r1) and T2(V2, E2, r2) is a bijection between the vertex sets
Rooted trees Definition Rooted tree (V , E, r) is a tree (V , E) with selected root r ∈ V . Definition Isomorphism of rooted trees T1(V1, E1, r1) and T2(V2, E2, r2) is a bijection between the vertex sets
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: Rooted trees Definition Rooted tree
Page 11 and 12: 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 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 59 and 60:
Understanding AHU algorithm (part 3
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
AHU algorithm improvement Observati
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Example A B C AHU algorithm example
Page 75 and 76:
Example A B C AHU algorithm example
Page 77 and 78:
Example A AHU algorithm example B 1
Page 79 and 80:
Example AHU algorithm example A 1 2
Page 81 and 82:
Example A AHU algorithm example 1 a
Page 83 and 84:
Resume Resume ∙ We have made thre
show all

Tree isomorphism

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

Delete template?

Save as template?