On Convex Geometric Graphs with no k + 1 Pairwise Disjoint Edges.
Chaya KellerMicha A. PerlesPublished in: Graphs Comb. (2016)
Keyphrases
- pairwise
- graph matching
- directed graph
- weighted graph
- undirected graph
- spanning tree
- high order
- pairwise similarities
- graph theoretical
- edge weights
- massive graphs
- real world graphs
- higher order
- min cut
- multi class
- loss function
- semi supervised
- convex hull
- spectral embedding
- graph theory
- graph databases
- convex optimization
- graph theoretic
- graph partitioning
- similarity measure
- convex sets
- geometric information
- directed edges
- social networks
- geometric structure
- geometric constraints
- graph structure
- edge detector
- spectral clustering
- random walk
- reeb graph
- topological information
- photometric properties
- graph model
- random graphs
- graph clustering
- pairwise constraints
- potential functions
- edge map
- piecewise linear
- edge information
- bipartite graph
- similarity function
- connected components
- shortest path
- markov random field
- image processing