A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter.
Hoàng-Oanh LeVan Bang LePublished in: Theor. Comput. Sci. (2019)
Keyphrases
- bipartite graph
- maximum matching
- maximum cardinality
- bipartite graph matching
- maximum weight
- link prediction
- stable set
- minimum weight
- matching algorithm
- graph matching
- worst case
- decision trees
- reinforcement learning
- social networks
- endpoints
- graph clustering
- bipartite networks
- information retrieval
- machine learning