DocumentCode
2957485
Title
An improved algorithm to discover isomorphism
Author
Khiyal, Malik Sikandar Hayat ; Arshad, Muhammad ; Riaz, Khadija
Author_Institution
Dept. of Comput. Sci., Int. Islamic Univ., Islamabad, Pakistan
fYear
2003
fDate
8-9 Dec. 2003
Firstpage
396
Lastpage
401
Abstract
Despite the fact that graph based methods are gaining more and more popularity in different scientific areas, it has to be considered that we still need such an efficient algorithm for graph isomorphism which is applicable on all the general graphs. We propose an improved algorithm for discovering graph isomorphism. The emphasis is on the power of algorithm for solving practical problems and making the algorithm more efficient. The algorithm works for all kinds of undirected graphs.
Keywords
data structures; graph theory; discrete structures; general graphs; graph isomorphism; undirected graphs; Books; Chemistry; Data structures; Information retrieval; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Multi Topic Conference, 2003. INMIC 2003. 7th International
Print_ISBN
0-7803-8183-1
Type
conf
DOI
10.1109/INMIC.2003.1416758
Filename
1416758
Link To Document