Algorithms for the tree isomorphism problem

Petar Magdevski (2016) Algorithms for the tree isomorphism problem. EngD thesis.

Preview

Abstract

In this thesis algorithms for checking isomorphism between trees are elaborated. Tree definition is provided, basic concepts of tree traversals are described, details of tree isomorphism algorithms are given, putting special attention and focus on unordered tree isomorphism, algorithm by Valiente as well as algorithm by Aho, Hopcroft and Ullman. Algorithms have been implemented and compared. Comparison was done upon the times needed for each of the algorithms to determine the isomorphism between randomly generated trees. Trees were classified in groups depending on the number of vertices and both algorithms were executed over each group of vertices.

Item Type:

Thesis (EngD thesis)

Keywords:

tree, isomorphism, algorithm.

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
doc. dr. Jurij Mihelič	305	Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536838083)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

3277

Date Deposited:

15 Mar 2016 16:24

Last Modified:

29 Mar 2016 13:31

URI:

http://eprints.fri.uni-lj.si/id/eprint/3277

Actions (login required)

View Item