Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs.
Ahmad BiniazAnil MaheshwariMichiel H. M. SmidPublished in: Inf. Process. Lett. (2020)
Keyphrases
- higher order
- neighborhood graph
- maximum cardinality
- minimum spanning trees
- high order
- graph matching
- natural images
- pairwise
- graph structure
- graph construction
- bipartite graph
- weighted graph
- markov random field
- graph mining
- minimum spanning tree
- random graphs
- low order
- lower order
- graph coloring
- feature selection
- graphical models
- high dimensional
- series parallel
- knn
- minimum cost
- graph model
- directed graph