Graph Theory and Applications
Van Dooren P.
Presentation. — Dublin, 2009. — 110 p.
What we will cover in this course:
Basic theory about graphs.
Connectivity.
Paths.
Trees.
Networks and flows.
Eulerian and Hamiltonian graphs.
Coloring problems.
Complexity issues.
A number of applications (in large graphs):
Large scale problems in graphs.
Similarity of nodes in large graphs.
Telephony problems and graphs.
Ranking in large graphs.
Clustering of large graphs.
What we will cover in this course:
Basic theory about graphs.
Connectivity.
Paths.
Trees.
Networks and flows.
Eulerian and Hamiltonian graphs.
Coloring problems.
Complexity issues.
A number of applications (in large graphs):
Large scale problems in graphs.
Similarity of nodes in large graphs.
Telephony problems and graphs.
Ranking in large graphs.
Clustering of large graphs.
Amazon 
Barnes & Noble 
Bookshop.org
გსურთ დაამატოთ წიგნის მაღაზია? დაგვიკავშირდით support@z-lib.do-ით
ფაილების კონვერტაცია
ძიების მეტი შედეგი
სხვა უპირატესობები 
![Andrew Goodall — Vybrané kapitoly z kombinatoriky: Many facets of the Tutte polynomial [Lecture notes]](https://s3proxy.cdn-zlib.se/covers200/collections/genesis/e3d27245e1f1f81ada956d72638abf46d0960a3fb5e6289e717a27904e9ef361.jpg)
![Tero Harju — Lecture notes on Graph Theory [Lecture notes]](https://s3proxy.cdn-zlib.se/covers200/collections/genesis/fb5b4c4f5343aea54d31c5dfe529fe37337c9979bc5c0a3ab38c62450f20e890.jpg)
