Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs.
Pinar HeggernesDaniel MeisterAndrzej ProskurowskiPublished in: SWAT (2008)
Keyphrases
- bipartite graph
- graph model
- undirected graph
- minimum cost
- graph partitioning
- spanning tree
- square error
- edge weights
- shortest path
- graph matching
- connected graphs
- low dimensional
- vector space
- graph representation
- np hard
- directed graph
- graph databases
- real valued
- graph theory
- human visual system
- vector quantizer
- image compression
- manifold learning
- graph theoretic
- random graphs
- threshold values
- strongly connected
- minimum length
- dimensionality reduction