MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk

Entropy - Switzerland
doi 10.3390/e21060569
Full Text
Abstract

Available in full text

Date
Authors
Publisher

MDPI AG

Related search

The Discrete-Time Quaternionic Quantum Walk and the Second Weighted Zeta Function on a Graph

Interdisciplinary Information Sciences
2017English

Link Prediction Using Discrete-Time Quantum Walk

Tehnicki Vjesnik
Engineering
2017English

The State Space Isomorphism Theorem for Discrete-Time Infinite-Dimensional Systems

Integral Equations and Operator Theory
Number TheoryAnalysisAlgebra
2015English

Group, Graphs, Algorithms: The Graph Isomorphism Problem

2019English

Fast Algorithm for Graph Isomorphism Testing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Simple Random Walk Statistics. Part I: Discrete Time Results

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
1996English

Non Symmetric Random Walk on Infinite Graph

Opuscula Mathematica
Mathematics
2011English

Two-Walker Discrete-Time Quantum Walks on the Line With Percolation

Scientific Reports
Multidisciplinary
2016English

An Explicit Isomorphism Between Floer Homology and Quantum Homology

Pacific Journal of Mathematics
Mathematics
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy