The geometry of graphs and some of its algorithmic applications

Keyphrases

• Small Distortion 100%
• Pattern Recognition 66%
• Graph Embedding 66%
• Multicommodity Flow 66%
• Tight 33%
• Statistical Data 33%
• Expander 33%
• Euclidean Space 33%
• Constant Degree 33%
• Graph-theoretic 33%
• Algorithmic Problems 33%
• Any Dimension 33%
• Geometric Objects 33%
• Heuristic Method 33%
• Polynomial-time Algorithm 33%
• Weighted Graph 33%
• Min-cut 33%
• Geometric Representation 33%
• Unified Approach 33%
• Embeddable 33%
• Low-dimensional Representation 33%
• Low-dimensional Space 33%
• Viewing Graph 33%
• Maximum Flow 33%
• Efficient Clustering 33%
• Normed Space 33%
• Geometric Images 33%
• Distance between Vertices 33%
• Low Diameter Decomposition 33%
• Tight Cut 33%
• Balanced Separators 33%

Mathematics

• Pattern Recognition 100%
• Polynomial Time 50%
• Expander 50%
• Euclidean Space 50%
• Clustering 50%
• Open Question 50%
• Geometric Object 50%
• Dimensional Space 50%
• Graph Model 50%
• weighted graph 50%
• Min-Cut 50%
• Normed Space 50%
• Graph Embedding 50%
• Geometric Representation 50%
• Heuristic Method 50%

Computer Science

• Pattern Recognition 100%
• Efficient Algorithm 50%
• polynomial-time algorithm 50%
• weighted graph 50%
• Lower Dimensional Space 50%
• Geometric Representation 50%
• Statistical Data 50%
• Heuristic Method 50%