find the maximum subset vertices of DAG

→ Pay attention

*has extra registration

→ Top rated

→ Top contributors

View all →

→ Find user

→ Recent actions

Detailed →

find the maximum subset vertices of DAG

Difference between en1 and en2, changed 14 character(s)

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, |E| <= 20000

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	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)