Spanning trees with pairwise nonadjacent endvertices.
Thomas BöhmeHajo BroersmaF. GöbelAlexandr V. KostochkaMichael StiebitzPublished in: Discret. Math. (1997)
Keyphrases
- spanning tree
- pairwise
- edge disjoint
- minimum spanning tree
- minimum cost
- similarity measure
- minimum spanning trees
- pairwise interactions
- multi class
- higher order
- markov random field
- semi supervised
- depth first search
- loss function
- similarity function
- belief propagation
- undirected graph
- graph matching
- minimum total cost
- worst case
- statistical significance
- query processing
- high order
- clustering method
- high level