Lower bounds for the Laplacian energy of bipartite graphs.
José Luis PalaciosPublished in: Discret. Appl. Math. (2018)
Keyphrases
- bipartite graph
- lower bound
- upper bound
- maximum matching
- branch and bound algorithm
- minimum weight
- objective function
- branch and bound
- link prediction
- worst case
- np hard
- optimal solution
- maximum weight
- mutual reinforcement
- supervised learning
- state space
- vc dimension
- max sat
- graph clustering
- data sets
- bipartite graph matching