Pokročilé aplikace hranově magická ohodnocení grafů

Abstract

Presented work deals with sparse matrix storing, which is essential for a wide range of matrix operations. Operating with high-dimensional sparse matrices is not possible without their proper structure manipulation. This work tries to find effective sparse matrix storing with minimal time intensity. We compare known ways of sparse matrix storing with a new form based on edge-magic labeling form. Related with thesis [3], this text investigates the possibility of getting better results by using generalized edge-magic labeling form with lifted requirements, yet without time intensity increased. This work presents generalized edge-magic labeling of Pm□Pn for every integer m, n where m is odd. Also, we derived a generalized egde-magic storing and this work contains time intensity results of sparse matrix-vector operations and comparison time intensity of generalized edge-magic form with other known forms of storing.

Description

Import 04/07/2011

Subject(s)

graph labeling, edge-magic total labeling, super edge-magic total labeling, generalized edge-magic total labeling, sparse matrix, sparse matrix storing, edge-magic labeling storing form

Citation