Next: About this document
Up: Vision IV
Previous: Further Reading
- Write a basic model based matching tree search algorithm in LISP and C.
- Go through the example matching methods described and classify their
search method according to lectures on searching etc..
- With regards to the graph matching problem find out or devise algorithms
that match graphs or subgraphs ((sub)graph isomorphisms and maximal
clique location (unique totally connected subgraphs). Assemble these
algorithms so that a graph matching algorithm can be implemented.
dave@cs.cf.ac.uk