Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets.
David BremnerLars SchewePublished in: Exp. Math. (2011)
Keyphrases
- weighted graph
- convex hull
- undirected graph
- edge weights
- convex combinations
- disjoint paths
- upper bound
- graph structure
- lower bound
- random walk
- vertex set
- graph representation
- directed graph
- convex optimization
- graph theory
- directed acyclic graph
- structured data
- graph partitioning
- edge information
- edge detection
- piecewise linear
- generalization bounds
- spanning tree
- convex sets
- strongly connected
- worst case
- image processing
- graph matching
- semi supervised
- edge detector
- pairwise
- average degree
- shortest path