Published by LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202517123 ISBN 13: 9786202517126
Language: English
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New.
Published by LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202517123 ISBN 13: 9786202517126
Language: English
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Fundamentals of Computer Algorithms | Vishwajit Barbuddhe (u. a.) | Taschenbuch | 64 S. | Englisch | 2020 | LAP LAMBERT Academic Publishing | EAN 9786202517126 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
Published by LAP LAMBERT Academic Publishing Mrz 2020, 2020
ISBN 10: 6202517123 ISBN 13: 9786202517126
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The book contains: Algorithms and Complexity: Asymptotic notations, orders, worst-case and average-case, amortized complexity. Basic Techniques: divide & conquer, dynamic programming, greedy method, backtracking. Branch and bound, randomization. Data Structures: heaps, search trees, union-find problems. Applications: sorting & searching, combinatorial problems. Optimization problems, computational geometric problems, string matching. Graph Algorithms: BFS and DFS, connected components. Spanning trees, shortest paths, MAX-flow. NP - completeness, Approximation algorithms. 64 pp. Englisch.
Published by LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202517123 ISBN 13: 9786202517126
Language: English
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand.
Published by LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202517123 ISBN 13: 9786202517126
Language: English
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND.
Published by LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202517123 ISBN 13: 9786202517126
Language: English
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Barbuddhe VishwajitProf. V. K. Barbudhe is working as Professor at Jagadambha College of Engg & Technology for UG & PG Dept. Years of experience 11+. He published more than 50+ papers in international journals. Worked as an internati.
Published by LAP LAMBERT Academic Publishing Mär 2020, 2020
ISBN 10: 6202517123 ISBN 13: 9786202517126
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The book contains: Algorithms and Complexity: Asymptotic notations, orders, worst-case and average-case, amortized complexity. Basic Techniques: divide & conquer, dynamic programming, greedy method, backtracking. Branch and bound, randomization. Data Structures: heaps, search trees, union-find problems. Applications: sorting & searching, combinatorial problems. Optimization problems, computational geometric problems, string matching. Graph Algorithms: BFS and DFS, connected components. Spanning trees, shortest paths, MAX-flow. NP - completeness, Approximation algorithms.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 64 pp. Englisch.
Published by LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202517123 ISBN 13: 9786202517126
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The book contains: Algorithms and Complexity: Asymptotic notations, orders, worst-case and average-case, amortized complexity. Basic Techniques: divide & conquer, dynamic programming, greedy method, backtracking. Branch and bound, randomization. Data Structures: heaps, search trees, union-find problems. Applications: sorting & searching, combinatorial problems. Optimization problems, computational geometric problems, string matching. Graph Algorithms: BFS and DFS, connected components. Spanning trees, shortest paths, MAX-flow. NP - completeness, Approximation algorithms.