Login / Signup
The Matching Problem in General Graphs is in Quasi-NC.
Ola Svensson
Jakub Tarnawski
Published in:
Electron. Colloquium Comput. Complex. (2017)
Keyphrases
</>
graph matching
special case
matching algorithm
closely related
matching process
graph matching algorithm
maximum cardinality
neural network
approximate matching
relational structures
graph theoretic
graph model
graph mining
directed graph
feature points
case study
clustering algorithm
learning algorithm