Is maximum matching on a non-bipartite graph possible?

Правка en1, от tactical-teto, 2024-10-24 10:32:51

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

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский tactical-teto 2024-10-24 10:32:51 231 Initial revision (published)