On the maximal distance between triangular embeddings of a complete graph.
Vladimir P. KorzhikPublished in: J. Comb. Theory, Ser. B (2006)
Keyphrases
- independent set
- distance measure
- minimum distance
- euclidean distance
- graph theory
- graph representation
- weighted graph
- graph structure
- euclidean space
- manifold learning
- random walk
- graph structures
- neighborhood graph
- graphical models
- graph matching
- structured data
- graph model
- spanning tree
- graph construction
- dimensionality reduction
- distance metric
- stable set
- graph based algorithm
- dependency graph
- np complete
- link analysis
- high dimensional data
- data sets
- directed graph
- connected components