Pairwise colliding permutations and the capacity of infinite graphs.
János KörnerClaudia MalvenutoPublished in: SIAM J. Discret. Math. (2006)
Keyphrases
- pairwise
- graph matching
- multi class
- similarity measure
- graph mining
- spectral clustering
- semi supervised
- probability distribution
- finite sets
- loss function
- graph structure
- graph representation
- pairwise interactions
- random graphs
- pairwise constraints
- graph data
- graph theoretic
- data sets
- graph theory
- pattern recognition
- point sets
- directed graph
- markov random field
- higher order