4 710 záznamů v Medvik

... Contents -- Graph Algorithms -- Chapter 17. ... ... • 228 -- 20.3 Prim’s Algorithm and Priority-First Search • 235 -- 20.4 Kruskal’s Algorithm • 246 -- ... ... 20.5 Boruvka’s Algorithm • 252 -- 20.6 Comparisons and Improvements • 255 -- 20.7 Euclidean MST • 261 ... ... Network Flows 353 -- 22.1 Flow Networks • 359 -- 22.2 Augmenting-Path Maxflow Algorithms • 370 -- 22.3 ... ... Preflow-Push Maxflow Algorithms • 396 -- 22.4 Maxflow Reductions • 411 -- 22.5 Mincost Flows • 429 - ...

Boston : Addison-Wesley, 2002

3rd ed. 482 s.

. 2003 ; Roč. 6 (č. 2) : s. 104-108.

. 2022 ; 16 (1) : 48-51. [pub] 20220404

. 2018 ; 20 () : 66-71.

... Contents -- Preface xv -- 1 Introduction 1 -- 2 Algorithms and Complexity 7 -- 2.1 What Is an Algorithm ... ... 7 -- 2.2 Biological Algorithms versus Computer Algorithms 14 -- 2.3 The Change Problem 17 -- 2.4 Correct ... ... versus Incorrect Algorithms 20 -- 2.5 Recursive Algorithms 24 -- 2.6 Iterative versus Recursive Algorithms ... ... 28 -- 2.7 Fast versus Slow Algorithms 33 -- 2.8 Big-O Notation 37 -- 2.9 Algorithm Design Techniques ... ... 40 -- 2.9.1 Exhaustive Search 41 -- 2.9.2 Branch-and-Bound Algorithms 42 -- 2.9.3 Greedy Algorithms ...

Cambridge, Massachusets ; London, England : The MIT Press, 2004

Computational molecular biology series

[1st ed.] xviii, 435 s. : il.