An elementary approach to design and analysis of algorithms /
Vermani, Lekh Raj
An elementary approach to design and analysis of algorithms / by Lekh Raj Vermani (Kurukshetra University, India) and Shalini Vermani (Apeejay School of Management, India). - xvii, 515 pages 23 cm.
Includes bibliographical references and index.
All Pairs Shortest Paths Backtracking Divide and Conquer Dynamic Programming Elementary Graph Algorithms Flow Networks Greedy Algorithms Minimal Spanning Tree Polynomial Multiplication, to ways of solving NP-Complete Problems, supported with comprehensive, and detailed problems and solutions, making it an ideal resource to those studying computer science, computer engineering and information technology.--Abebooks.com Single-Source Shortest Paths This book introduces a set of concepts in solving problems computationally such as Growth of Functions
9781786346759 (hc : alk. paper)
2018056450
Algorithms
QA 9.58 / .V59 2019
An elementary approach to design and analysis of algorithms / by Lekh Raj Vermani (Kurukshetra University, India) and Shalini Vermani (Apeejay School of Management, India). - xvii, 515 pages 23 cm.
Includes bibliographical references and index.
All Pairs Shortest Paths Backtracking Divide and Conquer Dynamic Programming Elementary Graph Algorithms Flow Networks Greedy Algorithms Minimal Spanning Tree Polynomial Multiplication, to ways of solving NP-Complete Problems, supported with comprehensive, and detailed problems and solutions, making it an ideal resource to those studying computer science, computer engineering and information technology.--Abebooks.com Single-Source Shortest Paths This book introduces a set of concepts in solving problems computationally such as Growth of Functions
9781786346759 (hc : alk. paper)
2018056450
Algorithms
QA 9.58 / .V59 2019
