Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version)
Edith CohenNimrod MegiddoPublished in: STOC (1989)
Keyphrases
- preliminary version
- orders of magnitude
- graph isomorphism
- worst case
- dynamic networks
- graph theory
- benchmark datasets
- computational cost
- learning algorithm
- combinatorial optimization
- theoretical analysis
- polynomial time complexity
- representational power
- dynamic environments
- np complete
- optimization problems
- upper bound
- significant improvement
- computational complexity