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

Obtaining a Bipartite Graph by Contracting Few Edges.

Pinar HeggernesPim van 't HofDaniel LokshtanovChristophe Paul
Published in: FSTTCS (2011)
Keyphrases
  • bipartite graph
  • maximum matching
  • edge weights
  • link prediction
  • graph model
  • graph clustering
  • minimum weight
  • data sets
  • random walk
  • training set
  • directed graph
  • bipartite graph matching
  • maximum cardinality