PUSSY_LICKING_LOLI_69's blog

Is maximum matching on a non-bipartite graph possible?
By PUSSY_LICKING_LOLI_69, history, 4 weeks ago, In English

Given a graph with n nodes and m edges, is it possible to find the maximum number of edges such that each node is in at most one edge?

constraints:

n<=1000

m<=n*(n-1)/2

  • Vote: I like it
  • -34
  • Vote: I do not like it

»
4 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

Google first plz.

You can refer to here and here.

→ Reply