Login / Signup
Finding the prime factors of strong direct product graphs in polynomial time.
Joan Feigenbaum
Alejandro A. Schäffer
Published in:
Discret. Math. (1992)
Keyphrases
</>
special case
factors affecting
graph isomorphism
bounded treewidth
high level
computational complexity
graph matching
graph theoretic
graph theory
planar graphs
polynomial time complexity
data sets
factors influencing
random graphs
factors that influence
production planning
graph mining
worst case
neural network