Hardness and structural results for half-squares of restricted tree convex bipartite graphs.
Hoàng-Oanh LeVan Bang LePublished in: CoRR (2018)
Keyphrases
- bipartite graph
- maximum weight
- maximum matching
- convex constraints
- link prediction
- bipartite graph matching
- hough transform
- mutual reinforcement
- minimum weight
- computational complexity
- maximum cardinality
- graph clustering
- structural features
- convex optimization
- tree structure
- worst case
- minimum spanning tree
- phase transition
- bipartite networks
- graph structure
- np complete
- np hard
- decision trees