04.05.2013 Views

Tree isomorphism

Tree isomorphism

Tree isomorphism

SHOW MORE
SHOW LESS

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

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Algorithm by Aho, Hopcroft and Ullman<br />

∙ Determine tree <strong>isomorphism</strong> in time O(|V |).<br />

AHU algorithm<br />

∙ Uses complete history of degree spectrum of the vertex<br />

descendants as a complete invariant.<br />

The idea of AHU algorithm<br />

The AHU algorithm associates with each vertex a tuple that<br />

describes the complete history of its descendants.<br />

Hard question<br />

Why our previous invariants are not complete?<br />

Let’s discuss AHU algorithm. We start from O(|V | 2 ) version and<br />

then I tell how to make it faster (O(|V |)).<br />

13 / 22

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!