Exemplu de subiect AG 2


1) stabiliti card max al unei multimi stabile din graful G, unde n-nr intreg poz si G: (…un graf…)
2)G conex reprez cu listele de adiacenta.Adoptati strategia de parcurgere BFS pt a decide daca e bipartit
3)alg lui Dijkstra
4) G-cuplaj perfect. Dem ca si G x Pn e cuplaj perfect
5)Dem ca K3,3 nu e planar

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: