Convex hull of the edges of a graph and near bipartite graphs.
Jean François MaurrasPublished in: Discret. Math. (1983)
Keyphrases
- bipartite graph
- convex hull
- maximum matching
- edge weights
- graph model
- graph clustering
- minimum weight
- convex polyhedra
- maximum cardinality
- point sets
- directed graph
- stable set
- link prediction
- bipartite graph matching
- mixed integer
- feasible solution
- maximum weight
- mutual reinforcement
- spanning tree
- minimum spanning tree
- extreme points
- finite set of points
- affinity graph
- graph matching
- simple polygon
- training samples
- data points
- active learning
- reinforcement learning