Tinkara Toš (2012) Graph algorithms in the language of linear algebra. EngD thesis.
The thesis presents usefulness of duality between graph and his adjacency matrix. The teoretical part provides the basis of graph theory and matrix algebra mainly focusing on sparse matrices and options of their presentation witch takes into account the number of nonzero elements in the matrix. The thesis includes presentation of possible operations on sparse matrices and algorithms that basically work on graphs, but with help of duality between graph and his adjacency matrix can be presented with sequence of operations on matrices. Practical part presents implementation of some algorithms that can work both with graphs or their adjacency matrices in programming language Java and testing algorithms that work with matrices. It focuses on comparison in efficiency of algorithm working with matrix written in standard mode and with matrix written in format for sparse matrices. It also studies witch presentation of matrices works beter for witch algorithm.
|Item Type: ||Thesis (EngD thesis)|
|Keywords: ||Matrix, adjacency matrix, sparse matrix, grapg theory, breath first search, minimum path, Bellman-Ford algorithm, Floyd-Warshall algorithm, minimum spanning tree, Prim's algorithm|
|Number of Pages: ||101|
|Language of Content: ||Slovenian|
|Mentor / Comentors: |
|Name and Surname||ID||Function|
|doc. dr. Tomaž Dobravec||Mentor|
|Link to COBISS: ||http://www.cobiss.si/scripts/cobiss?command=search&base=50070&select=(ID=00009463124)|
|Institution: ||University of Ljubljana|
|Department: ||Faculty of Computer and Information Science|
|Item ID: ||1840|
|Date Deposited: ||22 Sep 2012 15:14|
|Last Modified: ||24 Oct 2012 10:17|
Actions (login required)