Search Results - Kishore, K.V.R.C.N.

  • Showing 1 - 1 results of 1
Refine Results
  1. 1
    An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs

    An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs by Kishore, K.V.R.C.N., Saxena, Sanjeev

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:

Search Tools: