A conjecture on the reconstruction of graphs from metric balls of their vertices.
Vladimir I. LevenshteinPublished in: Discret. Math. (2008)
Keyphrases
- weighted graph
- random graphs
- undirected graph
- maximum common subgraph
- labeled graphs
- adjacency matrix
- attributed graphs
- maximal cliques
- graph clustering
- graph theory
- image reconstruction
- graph matching
- metric space
- hamiltonian cycle
- planar graphs
- directed edges
- average degree
- directed graph
- graph representation
- three dimensional
- maximum cardinality
- phase transition
- vertex set
- connected subgraphs
- edge weights
- similarity metric
- internal camera parameters
- bipartite graph
- similarity measure
- query graph
- distance function
- planar scenes
- minimum weight
- subgraph isomorphism
- distance metric
- reconstruction method
- directed acyclic graph
- approximation algorithms