An efficient algorithm for computing permanental polynomials of graphs.
Yan HuoHeng LiangFengshan BaiPublished in: Comput. Phys. Commun. (2006)
Keyphrases
- learning algorithm
- computationally efficient
- improved algorithm
- experimental evaluation
- objective function
- optimization algorithm
- theoretical analysis
- high accuracy
- dynamic programming
- np hard
- k means
- significant improvement
- segmentation algorithm
- detection algorithm
- minimum spanning tree
- probabilistic model
- cost function
- ant colony optimization
- times faster
- recognition algorithm
- preprocessing
- undirected graph
- graph isomorphism