Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs.
Edith CohenNimrod MegiddoPublished in: J. ACM (1993)
Keyphrases
- times faster
- graph theory
- computational complexity
- worst case
- special case
- orders of magnitude
- benchmark datasets
- learning algorithm
- significant improvement
- optimization problems
- polynomial time complexity
- theoretical analysis
- data structure
- computationally efficient
- data mining
- bayesian networks
- graph search
- bounded treewidth
- genetic algorithm