On Minimum Girth of Graphs Reconstructible from Metric Balls of Their Vertices.
Vladimir I. LevenshteinPublished in: ISIT (2006)
Keyphrases
- weighted graph
- labeled graphs
- undirected graph
- maximum common subgraph
- random graphs
- spanning tree
- attributed graphs
- maximal cliques
- adjacency matrix
- minimum cost
- connected dominating set
- maximum cardinality
- hamiltonian cycle
- distance measure
- connected subgraphs
- directed edges
- metric space
- planar graphs
- graph databases
- graph theoretic
- average degree
- graph theory
- evaluation metrics
- graph matching
- euclidean distance
- minimum weight
- edge weights
- graph partitioning
- graph model
- vertex set
- graph kernels
- query graph
- minimum spanning tree
- similarity metric
- metric learning
- directed graph