Parallel Algorithm for Solving the Graph Isomorphism Problem

DOI10.18255/1818-1015-2020-1-86-94MaRDI QIDQ5060056zbMATH OpenOpenAlexFDO

Authors Vladimir Vasilevich Vasilchikov

Publication date 17 January 2023

Published in Modeling and Analysis of Information Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://mathnet.ru/eng/mais705

zbMATH Keywords

.NETgraph isomorphism problemparallel algorithmrecursion

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Solving problem of graph isomorphism by membrane-quantum hybrid model
• Parallel algorithms for planar graph isomorphism and related problems
• A simple \(O(\log N)\) time parallel algorithm for testing isomorphism of maximal outerplanar graphs
• Isomorphism testing via polynomial-time graph extensions
• scientific article; zbMATH DE number 2123426

Cites work

• A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
• Generating Random Regular Graphs Quickly
• Graph isomorphism in quasipolynomial time (extended abstract)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)

Cited in

(3)

• scientific article; zbMATH DE number 4060741 (Why is no real title available?)
• scientific article; zbMATH DE number 7295874 (Why is no real title available?)
• Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem

This page was built for publication: Parallel Algorithm for Solving the Graph Isomorphism Problem

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