Login / Signup

Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs.

Prosenjit BoseAlbert ChanFrank K. H. A. DehneMarkus Latzel
Published in: IPPS/SPDP (1999)
Keyphrases
  • coarse grained
  • maximum matching
  • bipartite graph
  • fine grained
  • shared memory
  • stable set
  • high level
  • link prediction
  • protein sequences
  • access control
  • co occurrence
  • message passing