Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon.
Hiro ItoPublished in: JCDCG (2004)
Keyphrases
- edge weights
- partial order
- weighted graph
- bipartite graph
- partially ordered
- directed graph
- spanning tree
- total order
- graph clustering
- shortest path
- convex hull
- minimum weight
- minimum spanning tree
- dense subgraphs
- directed acyclic graph
- satisfy the triangle inequality
- undirected graph
- geodesic distance
- image segmentation
- distance metric
- markov chain
- object detection
- high dimensional