The SVE method for regular graph isomorphism identification

DOI10.1007/s00034-015-0030-8zbMath1357.94113OpenAlexW1972978604WikidataQ59436424 ScholiaQ59436424MaRDI QIDQ737027

Feng Kang, Huiliang Shang, Siyuan Zhang, Chen Xu, Guo-Bin Chen

Publication date: 5 August 2016

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

Full work available at URL: https://doi.org/10.1007/s00034-015-0030-8

zbMATH Keywords

regular graphgraph isomorphismcircuit simulation methodsingle-vertex excitation (SVE) method

Mathematics Subject Classification ID

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

Related Items (1)

A time-based solution for the graph isomorphism problem

Cites Work

• Polynomial algorithms for open plane graph and subgraph isomorphisms
• Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation
• Applied graph theory in computer vision and pattern recognition
• A graph isomorphism algorithm for object recognition
• Compatible topologies on graphs: an application to graph isomorphism problem complexity

This page was built for publication: The SVE method for regular graph isomorphism identification