Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this

Table Of Contents

Aranjamente, combin˘ari, permut˘ari
1.1 Preliminarii
1.2 Produs cartezian
1.3 Submult¸imi
1.7 Combin˘ari
1.8 Combin˘ari cu repetit¸ie
1.9 Permut˘ari cu repetit¸ie
2.1 Compuneri ale unui num˘ar natural
2.2 Partit¸ii ale unui num˘ar natural
2.3 Partit¸ii ale unei mult¸imi finite
3.1 Definit¸ii generale
3.2 Reprezentarea grafurilor
3.3 Grade
3.4 Conexitate
3.5 Parcurgerea grafurilor
3.6 Algoritmul Roy-Warshall
4.1 Num˘arul ciclomatic
4.2 Teorema de caracterizare a arborilor
4.3 Num˘ararea arborilor part¸iali
4.4 Arbori part¸iali de cost minim
5.1 Teorema de caracterizare a arborescent¸elor
5.2 Arborescent¸e part¸iale de cost minim
Clase particulare de grafuri
6.1 Grafuri euleriene
6.2 Grafuri hamiltoniene
6.3 Grafuri bipartite
Distant¸e ¸si drumuri minime
7.1 Expunerea problemei
7.2 Algoritmul Dijkstra
7.3 Algoritmul Roy-Floyd
Fluxuri ˆın ret¸ele de transport
8.1 Problema fluxului maxim
8.2 Algoritmul Ford-Fulkerson
0 of .
Results for:
No results containing your search query
P. 1


Ratings: (0)|Views: 1,927 |Likes:
Published by Nicolae Mihai

More info:

Published by: Nicolae Mihai on Jun 29, 2011
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





You're Reading a Free Preview
Pages 5 to 7 are not shown in this preview.
You're Reading a Free Preview
Pages 12 to 82 are not shown in this preview.

Activity (41)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
vali7313 liked this
Nick Popa liked this
Adrian Calin liked this
Anca Incău liked this
Vlad Nește liked this
ssmile liked this
Alex Hadar liked this

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->