Slides (PDF)

More documents

Recommendations

Info

Motivation In some applications the chemical structures are often trees with millions of vertices: • gene splicing, • protein analysis, • molecular biology. Difference between O(n), O(n log n), and O(n 2 ) isomorphism algorithms is not just theoretical importance. 2 / 22
Graph isomorphism Definition Isomorphism of graphs G 1 (V 1 , E 1 ) and G 2 (V 2 , E 2 ) is a bijection between the vertex sets ϕ : V 1 → V 2 such that ∀u, v ∈ V 1 (u, v) ∈ E 1 ⇔ (ϕ(u), ϕ(v)) ∈ E 2 . 3 / 22
Page 1: Tree isomorphism Alexander Smal St.
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 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 53 and 54:
Understanding AHU algorithm Knuth t
Page 55 and 56:
Understanding AHU algorithm Knuth t
Page 57 and 58:
Understanding AHU algorithm (part 3
Page 59 and 60:
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:
AHU algorithm example Example A a B
Page 75 and 76:
Page 77 and 78:
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?