*** meet in the middle BFS
**** Probleme:
** 'Ciclu eulerian':problema/ciclueuler

*** Probleme:
** 'Componente biconexe':problema/biconex
*** Probleme:
** 'Componente tare-conexe':problema/ctc
*** Probleme:
*** '2-SAT':problema/2sat
**** Probleme:
** 'Sortare topologica':problema/sortaret
*** Probleme:

* Drumuri minime
** 'Dijkstra':problema/dijkstra

** Sistem de inegalitati
** 'Ciclu de cost mediu minim':ciclu-de-cost-mediu-minim

h3. Grafuri neorientate

* Colorare

* 'Componente biconexe':problema/biconex

* Grafuri planare
** Probleme:

h3. Grafuri orientate

* Grafuri turneu/ciclu hamiltonian
** Probleme: 'plimbare':problema/plimbare

* 'Componente tare-conexe':problema/ctc
* 'Sortare topologica':problema/sortaret

h3. Arbori
* 'Diametrul unui arbore':problema/darb

* 'Lowest Common Ancestor':problema/lca

* 'Izomorfism de arbori':http://online-judge.uva.es/board/viewtopic.php?p=22754&highlight=#22754
* Smen 2 DFS-uri
** Probleme:

* 'Heavy path decomposition':problema/hpd

* Cod Prufer
h3. 'Flux':problema/maxflow si 'Cuplaj':problema/cuplaj

* Prim
* Kruskal

** Probleme:

* Al doilea APM
* APM in graf orientat
* Kirchhoff's matrix tree theorem