Skip to main content
SpringerLink
Log in

An Optimized Circuit Simulation Method for the Identification of Isomorphic Disconnected Graphs

  • Short Paper
  • Published:
Circuits, Systems, and Signal Processing Aims and scope Submit manuscript

Abstract

Many algorithms exist to deal with the problem of graph isomorphism, but most of the contemporary algorithms like VF2 have a bad performance for identifying isomorphism of disconnected graphs. In this paper, we propose a method that can filter and remove single vertices so as to eliminate the dependence of the relationship between all vertices which causes the loss of effectiveness. Tests on disconnected graphs demonstrate that this method can solve the problem of identifying isomorphic disconnected graphs in polynomial time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. M.S. Abadir, J. Ferguson, An improved layout verification algorithm (LAVA), in Proceedings of the Conference on European Design Automation (IEEE Comput. Soc., Los Alamitos, 1990), pp. 391–395

    Google Scholar 

  2. M.A. Abdulrahim, M. Misra, A graph isomorphism algorithm for object recognition. PAA Pattern Anal. Appl. 1(3), 189–201 (1998)

    Article  MATH  Google Scholar 

  3. T.S. Caetano, J.J. McAuley, L. Cheng, Q.V. Le, A.J. Smola, Learning graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 31(6), 1048–1058 (2009)

    Article  Google Scholar 

  4. L.P. Cordella, P. Foggia, C. Sansone, M. Vento, A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367–1372 (2004)

    Article  Google Scholar 

  5. C. Ebeling, GeminiII: a second generation layout validation program, in IEEE International Conference on Computer-Aided Design (ICCAD-88). Digest of Technical Papers, 7–10 Nov. 1988, pp. 322–325

    Chapter  Google Scholar 

  6. J.L. Faulon, Isomorphism, automorphism partitioning, and canonical labeling can be solved in polynomial-time for molecular graphs. J. Chem. Inf. Comput. Sci. 38(3), 432–444 (1998)

    Article  Google Scholar 

  7. F. Li, H. Shang, P.-Y. Woo, Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation. Circuits Syst. Signal Process. 27(5), 749–761 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. T. Mruthyunjaya, Kinematic structure of mechanisms revisited. Mech. Mach. Theory 38(4), 279–320 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. H. Shang, F. Li, X. Tang, P.Y. Woo, A new algorithm for isomorphism determination of undirected graphs-circuit simulation method. Circuits Syst. Signal Process. 30(5), 1115–1130 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. H. Shang, J. Li, Q. Cai, W. Dong, An optimized algorithm for the identification of isomorphic undirected graphs, in Proceedings of 2011 International Conference on Modelling, Identification and Control (ICMIC) (IEEE Press, New York, 2011), pp. 351–356

    Chapter  Google Scholar 

  11. L.N. Trefethen, D. Bau III, Numerical Linear Algebra, vol. 50 (SIAM, Philadelphia, 1997)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Fudan University, Shanghai, China

    Huiliang Shang, Yuan Gao & Jiajun Zhu

Authors
  1. Huiliang Shang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuan Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiajun Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Huiliang Shang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shang, H., Gao, Y. & Zhu, J. An Optimized Circuit Simulation Method for the Identification of Isomorphic Disconnected Graphs. Circuits Syst Signal Process 32, 2469–2473 (2013). https://doi.org/10.1007/s00034-013-9587-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00034-013-9587-2

Keywords

Search

Navigation