A polynomial time algorithm for finding the prime factors of cartesian-product graphs.
Joan FeigenbaumJohn HershbergerAlejandro A. SchäfferPublished in: Discret. Appl. Math. (1985)
Keyphrases
- preprocessing
- worst case
- simulated annealing
- polynomial time complexity
- computational complexity
- objective function
- graph isomorphism
- cartesian product
- detection algorithm
- learning algorithm
- optimal solution
- graph structure
- path planning
- dynamic programming
- clustering method
- segmentation algorithm
- particle swarm optimization
- np hard
- k means
- dynamic environments
- cost function
- graph model
- graph partitioning
- minimum spanning tree
- association rules
- adjacency graph
- mobile robot