DOI:10.20894/IJWT.
Periodicity: Bi Annual.
Impact Factor:
SJIF:4.78 & GIF:0.428
Submission:Any Time
Publisher: IIR Groups
Language: English
Review Process:
Double Blinded

News and Updates

Author can submit their paper through online submission. Click here

Paper Submission -> Blind Peer Review Process -> Acceptance -> Publication.

On an average time is 3 to 5 days from submission to first decision of manuscripts.

Double blind review and Plagiarism report ensure the originality

IJWT provides online manuscript tracking system.

Every issue of Journal of IJWT is available online from volume 1 issue 1 to the latest published issue with month and year.

Paper Submission:
Any Time
Review process:
One to Two week
Journal Publication:
June / December

IJWT special issue invites the papers from the NATIONAL CONFERENCE, INTERNATIONAL CONFERENCE, SEMINAR conducted by colleges, university, etc. The Group of paper will accept with some concession and will publish in IJWT website. For complete procedure, contact us at admin@iirgroups.org

Paper Template
Copyright Form
Subscription Form
web counter
web counter
Published in:   Vol. 1 Issue 2 Date of Publication:   December 2012

Graph Matching Algorithm-Through Isomorphism Detection

L. Ravi,K. Sujitha

Page(s):   54-60 ISSN:   2278-2397
DOI:   10.20894/IJWT.104.001.002.006 Publisher:   Integrated Intelligent Research (IIR)

This Paper delivers a new algorithm to the problem of graph isomorphism detection. Basically this method is designed in such a way that, a model graph which is known prior is compared with an unknown graph called input graph. Now the problem to be solved is to find a graph isomorphism from the input graph which is given online with the one which is known as model graph. At dynamic time the input graph is compared with the entire model graph for which there exists a graph isomorphism from the input graph are detected. The time complexity depends on the number of input graphs given and size of the graphs. Furthermore it is independent of number of model graphs given and the number of edges in any of the graph