A sufficient condition for bipartite graphs to be type one.
Baogang XuPublished in: J. Graph Theory (1998)
Keyphrases
- sufficient conditions
- bipartite graph
- maximum matching
- minimum weight
- exponential stability
- uniform convergence
- linear complementarity problem
- lyapunov function
- linear systems
- semidefinite
- asymptotic stability
- efficiently computable
- link prediction
- equilibrium point
- bipartite graph matching
- maximum cardinality
- neural network