Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs
Noga AlonAlan M. FriezeDominic WelshPublished in: FOCS (1994)
Keyphrases
- graph isomorphism
- bounded treewidth
- polynomial time complexity
- polynomial hierarchy
- bounded degree
- polynomial size
- planar graphs
- np complete
- low degree
- quasi cliques
- dnf formulas
- worst case
- special case
- spanning tree
- graph databases
- graph mining
- graph matching
- membership and equivalence queries
- stereo correspondence
- linear space
- graph kernels
- graph clustering
- learning algorithm
- graph data
- graph partitioning
- graph model
- graph theory
- bipartite graph
- computational complexity