• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

The Complexity of Contracting Bipartite Graphs into Small Cycles.

R. KrithikaRoohani SharmaPrafullkumar Tale
Published in: WG (2022)
Keyphrases
  • bipartite graph
  • maximum matching
  • minimum weight
  • graph model
  • computational complexity
  • link prediction
  • bipartite graph matching
  • reinforcement learning
  • active learning
  • worst case
  • np complete