A heuristic algorithm of recognition of isomorphism of graphs

DOI10.1023/A:1016632503967MaRDI QIDQ5951348zbMATH OpenOpenAlexFDO

Authors N. N. Glibovets, S. A. Ivashchenko

Publication date 6 January 2002

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1016632503967

zbMATH Keywords

heuristic polynomial algorithmnonoriented graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2123426
• scientific article; zbMATH DE number 3968624
• A graph isomorphism algorithm for object recognition
• Algorithmic aspects of algebraic methods for graph isomorphism testing
• Isomorphism testing algorithm for graphs: Incidence degree sequence method and applications

Cited in

(26)

• A fast backtrack algorithm for graph isomorphism
• A graph isomorphism algorithm for object recognition
• Isomorphism testing algorithm for graphs: Incidence degree sequence method and applications
• scientific article; zbMATH DE number 3856426 (Why is no real title available?)
• scientific article; zbMATH DE number 3875344 (Why is no real title available?)
• scientific article; zbMATH DE number 7403940 (Why is no real title available?)
• Some recognition problems related to graph isomorphism
• An algorithm for graph optimal monomorphism
• Algorithmic aspects of algebraic methods for graph isomorphism testing
• Checking of deterministic graphs.
• scientific article; zbMATH DE number 5525608 (Why is no real title available?)
• scientific article; zbMATH DE number 3904629 (Why is no real title available?)
• scientific article; zbMATH DE number 3957176 (Why is no real title available?)
• scientific article; zbMATH DE number 3968624 (Why is no real title available?)
• scientific article; zbMATH DE number 3985261 (Why is no real title available?)
• An optimally data efficient isomorphism inference algorithm
• scientific article; zbMATH DE number 166022 (Why is no real title available?)
• A graph-densification operator. The kinship graph
• scientific article; zbMATH DE number 4114685 (Why is no real title available?)
• scientific article; zbMATH DE number 1839469 (Why is no real title available?)
• scientific article; zbMATH DE number 1855641 (Why is no real title available?)
• scientific article; zbMATH DE number 2123426 (Why is no real title available?)
• scientific article; zbMATH DE number 7145105 (Why is no real title available?)
• Invariants of connected graphs and vector spaces of cycles and cuts
• A new algorithm for isomorphism determination of undirected graphs-circuit simulation method
• On the recognition of isomorphism of bipartite graphs

This page was built for publication: A heuristic algorithm of recognition of isomorphism of graphs

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