Data structures and network algorithms
Robert Endre Tarjan (Society for Industrial and Applied Mathematics, 1983)
|
There has been an explosive growth in the field of combinatorial algorithms. These algorithms depend not only on results in combinatorics and especially in graph theory, but also on the development of new data structures and new techniques for analyzing algorithms. Four classical problems in network optimization are covered in detail, including a development of the data structures they use and an analysis of their running time. Data Structures and Network Algorithms attempts to provide the reader with both a practical understanding of the algorithms, described to facilitate their easy implementation, and an appreciation of the depth and beauty of the field of graph algorithms. |
Data structures and network algorithms.pdf :: Unduh
|
No. Panggil : | e20448031 |
Entri utama-Nama orang : | |
Subjek : | |
Penerbitan : | Philadelphia: Society for Industrial and Applied Mathematics, 1983 |
Sumber Pengatalogan: | LibUI eng rda |
Tipe Konten: | text |
Tipe Media: | computer |
Tipe Pembawa: | online resources |
Deskripsi Fisik: | vii, 131 pages : illustration |
Tautan: | http://portal.igpublish.com/iglibrary/search/SIAMB0000034.main.html?12 |
Lembaga Pemilik: | |
Lokasi: |
No. Panggil | No. Barkod | Ketersediaan |
---|---|---|
e20448031 | 02-17-942521264 | TERSEDIA |
Ulasan: |
Tidak ada ulasan pada koleksi ini: 20448031 |