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

A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs.

George B. MertziosAndré NichterleinRolf Niedermeier
Published in: SIAM J. Discret. Math. (2018)
Keyphrases
  • maximum cardinality
  • bipartite graph
  • minimum weight
  • endpoints
  • weighted graph
  • link prediction
  • objective function
  • graph matching
  • greedy heuristic