Login / Signup

The existence of universally agreed fairest semi-matchings in any given bipartite graph.

Jian XuSoumya BanerjeeWenjing Rao
Published in: Theor. Comput. Sci. (2020)
Keyphrases
  • bipartite graph
  • maximum cardinality
  • minimum weight
  • maximum matching
  • graph model
  • link prediction
  • graph clustering
  • pattern recognition
  • network structure
  • edge weights
  • maximum weight
  • bipartite networks