A new algorithm for isomorphism determination of undirected graphs-circuit simulation method

DOI10.1007/S00034-010-9248-7zbMATH Open1228.94037OpenAlexW2088870914MaRDI QIDQ640393FDOQ640393

Authors: Huiliang Shang, Feng Li, XianDing Tang, Pengyung Woo 

Publication date: 18 October 2011

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

Full work available at URL: https://doi.org/10.1007/s00034-010-9248-7

Recommendations

• scientific article; zbMATH DE number 7403940
• Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation
• Isomorphism testing algorithm for graphs: Incidence degree sequence method and applications
• A heuristic algorithm of recognition of isomorphism of graphs
• scientific article; zbMATH DE number 2123426

zbMATH Keywords

graph isomorphismcircuit simulationassociated circuit

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Isomorphism testing algorithm for graphs: Incidence degree sequence method and applications
• Title not available (Why is that?)
• Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation

Cited In (3)

• Title not available (Why is that?)
• Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation
• Title not available (Why is that?)

This page was built for publication: A new algorithm for isomorphism determination of undirected graphs-circuit simulation method

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