A new edge selection heuristic for computing the Tutte polynomial of an undirected graph
Michael B. MonaganPublished in: CoRR (2012)
Keyphrases
- undirected graph
- positive integer
- approximation algorithms
- directed graph
- disjoint paths
- connected components
- minimum cost
- spanning tree
- complex networks
- graph structure
- directed acyclic graph
- random graphs
- dynamic programming
- selection strategies
- vertex set
- social network analysis
- simulated annealing
- optimal solution
- edge weights
- computer vision
- lagrange interpolation
- minimum spanning tree
- packing problem
- search space
- database systems