find the maximum subset vertices of DAG

Правка en1, от start_over, 2023-07-15 02:01:32

Given a DAG (V, E), find the maximum subset V' of V so that every vertex in V' can't reach other vertices in V'. |V| <= 3000

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский start_over 2023-07-15 02:25:06 14 Tiny change: 'V| <= 3000' -> 'V| <= 3000, |E| <= 20000'
en1 Английский start_over 2023-07-15 02:01:32 163 Initial revision (published)