Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees.
Stefanie GerkeGregory Z. GutinAnders YeoYacong ZhouPublished in: CoRR (2024)
Keyphrases
- maximum weight
- lower bound
- independent set
- weighted graph
- bipartite graph
- np hard
- bipartite matching
- minimum weight
- upper bound
- partial order
- objective function
- bipartite graph matching
- spanning tree
- shortest path
- vc dimension
- minimum spanning tree
- worst case
- graph matching
- association graph
- graph theory
- randomized algorithm
- social network analysis
- multi dimensional
- optimal solution