Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation

Circuits, Systems, and Signal Processing

Volumn 27, Issue 5, 2008, Pages 749-761

  Li, Feng ^a   Shang, Huiliang ^a   Woo, Peng Yung ^b  

^a FUDAN UNIVERSITY   (China)

^b NORTHERN ILLINOIS UNIVERSITY   (United States)

Author keywords

Adjoint circuit; Arbitrary graphs; Computational complexity; Graphisomorphism

Indexed keywords

CIRCUIT SIMULATION; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; SET THEORY;

ADJOINT; ADJOINT CIRCUIT; ARBITRARY GRAPHS; CIRCUIT ANALYSES; GRAPHISOMORPHISM; NODE VOLTAGES;

ELECTRIC NETWORK ANALYSIS;

EID: 54249163507     PISSN: 0278081X     EISSN: 15315878     Source Type: Journal    
DOI: 10.1007/s00034-008-9054-7     Document Type: Article

References (12)

1. K. Agusa, S. Fujita, M. Yamashita, On neural networks for graph isomorphism problem, in RNNS/IEEE Conf. Neuroinformatics/ Neuro-computers, Rostov-on-Don, South Russia (1992), pp. 1142-1148
2. S.B. Chen, K. Zuo, L.Z. Zhang, Network Graph Theory and Its Applications (Science Press, Beijing, 1982), pp. 176-181
3. L.P. Cordella, P. Foggia, C. Sansone, M.A. Vento, A (Sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26 (10), 1367-1372 (2004)
4. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979)
5. M. Gori, M. Maggini, L. Sarti, Exact and approximate graph matching using random walks. IEEE Trans. Pattern Anal. Mach. Intell. 27 (7), 1100-1111 (2005)
6. F. Li, P.-Y. Woo, Chinese signature verification: The topological approach and the waveform matching approach. Imaging Syst. Technol. 10 (4), 355-361 (1999)
7. C. Lin, Graph isomorphism and identification matrices: Parallel algorithms. IEEE Trans. Parallel Distrib. Syst. 7 (3), 306-319 (1996)
8. E.M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time. Comput. Syst. Sci. 25 (1), 42-65 (1982)
9. S.H.K. Malik, A. Muhammad, R. Khadija, An improved algorithm to discover isomorphism, in Proc. IEEE INMIC (2003), pp. 396-401
10. A.W. Mayeda, A testing method for isomorphic graphs and application to character recognition, in Proc. of the International Conf. on Circuits and Systems, Beijing, China (1985), pp. 158-161
11. D.A.L. Piriyakumar, P.A. Levi, Novel isomorphism based on nearest neighbours for efficient graph matching algorithm, in Proc. of the 7th International Conf. on Control, Automation, Robotics and Vision (2002), pp. 722-727
12. H.L. Shang, F. Li, P.-Y. Woo, An important property of isomorphic graphs and its application. IEEE Trans. Pattern Anal. Mach. Intell. (2008, submitted)