Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs.
Hoàng-Oanh LeVan Bang LePublished in: Algorithmica (2019)
Keyphrases
- bipartite graph
- maximum weight
- convex constraints
- maximum matching
- maximum cardinality
- minimum weight
- link prediction
- convex optimization
- tree structure
- np hard
- phase transition
- bipartite graph matching
- np complete
- mutual reinforcement
- worst case
- spanning tree
- structural features
- minimum spanning tree
- graph clustering
- hierarchical structure
- bipartite networks
- computational complexity