Kod: 01564262
Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and t ... więcej
83.01 €
Potrzebujesz więcej egzemplarzy?Jeżeli jesteś zainteresowany zakupem większej ilości egzemplarzy, skontaktuj się z nami, aby sprawdzić ich dostępność.
Za ten zakup dostaniesz 208 punkty
Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Furthermore, full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms. Numerous illustrations, examples, and exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference.
Kategoria Książki po angielsku Computing & information technology Computer science Mathematical theory of computation
83.01 €
Osobní odběr Bratislava a 2642 dalších
Copyright ©2008-24 najlacnejsie-knihy.sk Wszelkie prawa zastrzeżonePrywatnieCookies
Nákupní košík ( prázdný )