The K-discretization and K-incident graphs for discretizable Distance Geometry.
Germano AbudJorge AlencarCarlile LavorLeo LibertiAntonio MucherinoPublished in: Optim. Lett. (2020)
Keyphrases
- distance measure
- euclidean distance
- distance function
- graph matching
- graph theoretic
- geodesic distance
- preprocessing
- reeb graph
- topological information
- relative position
- graph representation
- graph partitioning
- bipartite graph
- neural network
- graph databases
- geometric structure
- weighted graph
- graph structure
- graph theory
- geometric information
- small world
- graph kernels
- random walk
- discretization method