On the minimal nonzero distance between triangular embeddings of a complete graph.
Mike J. GrannellTerry S. GriggsVladimir P. KorzhikJozef SiránPublished in: Discret. Math. (2003)
Keyphrases
- distance measure
- weighted graph
- graph representation
- graph theory
- dimensionality reduction
- random walk
- connected components
- graph theoretic
- euclidean distance
- distance matrix
- directed graph
- neighborhood graph
- graphical representation
- graph model
- path length
- minimum distance
- edge weights
- graph mining
- graph search
- stable set
- undirected graph
- graph databases
- web pages
- graph structure
- euclidean space
- manifold learning
- vector space
- np hard