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

DOI10.1007/S00034-008-9054-7zbMATH Open1173.94472OpenAlexW1997158367MaRDI QIDQ733697FDOQ733697

Authors: Feng Li, Huiliang Shang, Pengyung Woo 

Publication date: 19 October 2009

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00034-008-9054-7

Recommendations

• A new algorithm for isomorphism determination of undirected graphs-circuit simulation method
• scientific article; zbMATH DE number 7403940
• Isomorphism testing algorithm for graphs: Incidence degree sequence method and applications
• Some further development on the eigensystem approach for graph isomorphism detection
• A graph isomorphism algorithm using pseudoinverses

zbMATH Keywords

computational complexitygraph isomorphismadjoint circuitarbitrary graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Title not available (Why is that?)
• Isomorphism of graphs of bounded valence can be tested in polynomial time

Cited In (6)

• Title not available (Why is that?)
• Global similarity tests of physical designs of circuits: a complex network approach
• The SVE method for regular graph isomorphism identification
• Some further development on the eigensystem approach for graph isomorphism detection
• A computational approach to construct a multivariate complete graph invariant
• A new algorithm for isomorphism determination of undirected graphs-circuit simulation method

This page was built for publication: Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733697)