Vertices, edges, distances and metric dimension in graphs.
Ismael González YeroPublished in: Electron. Notes Discret. Math. (2016)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- directed edges
- distance function
- distance measure
- directed graph
- geodesic distance
- spanning tree
- vertex set
- euclidean distance
- distances between data points
- minimum weight
- triangle inequality
- graph structure
- random graphs
- shortest path
- adjacency matrix
- graph partitioning
- triangular inequality
- number of distance computations
- dissimilarity measure
- labeled graphs
- maximum common subgraph
- metric space
- directed acyclic graph
- bipartite graph
- attributed graphs
- hausdorff distance
- subgraph isomorphism
- multi dimensional scaling
- graph model
- graph clustering
- distance metric
- random walk
- average degree
- densely connected
- approximation algorithms
- connected graphs
- minimum cost
- spectral embedding
- complex networks
- real world graphs
- graph matching
- planar graphs
- maximal cliques
- connected components
- small world
- maximum cardinality
- evaluation metrics
- data points
- high dimensional
- edge information
- multiscale