The author’s passion for teaching core computer science courses, particularly discrete math and algorithms, inspired this book. Graphs are crucial in solving real-world problems, and this book aims to present graph theory gradually and accessibly. It provides a comprehensive overview of foundational and advanced concepts, starting with an introduction to graph theory, types of graphs, and their significance. The book covers key terms, properties, Eulerian and Hamiltonian graphs, isomorphism, subgraphs, and special graphs such as complete and bipartite graphs.
The representation of graphs is discussed highlighting their practical applications and differences. A dedicated chapter showcases the use of graphs such as search engines, networks, and bioinformatics. Various graph algorithms are detailed, including Eulerian tours, shortest paths, minimum spanning trees, maximum flow, and matching. An appendix on algorithm complexity provides insights into analyzing algorithms, time complexity.
This book is ideal for undergraduate and graduate students in mathematics, computer science, engineering, and those interested in mathematical structures. It is also valuable for software engineers and developers interested in modeling systems.
"synopsis" may belong to another edition of this title.
Aiman S. Gannous is an Associate Professor of Computer Science in the Department of Health Informatics at the University of Benghazi, Libya. Dr. Gannous earned both his B.Sc. (2001) and his M.Sc. in Computer Science and Artificial Intelligence (2008) from the University of Benghazi. In 2020, he received his PhD in Computer Science from the University of Denver in Colorado. Under the supervision of Professor Anneliese Andrews, his dissertation focused on the safety certification of safety-critical systems. While pursuing his doctoral studies in the United States, he served as an adjunct faculty member at the University of Denver, Regis University, and Metropolitan State University of Denver, where he taught a variety of undergraduate and graduate courses. In addition to his academic work, Dr. Gannous has industry experience as a Data Engineer at Arrow Electronics and as a Security Systems Developer at Ttec in Englewood, Colorado.
"About this title" may belong to another edition of this title.
Seller: INDOO, Avenel, NJ, U.S.A.
Condition: New. Seller Inventory # 9783119143721
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condition: New. Graph Theory: Connectivity, Software Engineering and Bioinformatics. Book. Seller Inventory # BBS-9783119143721
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: new. Paperback. The authors passion for teaching core computer science courses, particularly discrete math and algorithms, inspired this book. Graphs are crucial in solving real-world problems, and this book aims to present graph theory gradually and accessibly. It provides a comprehensive overview of foundational and advanced concepts, starting with an introduction to graph theory, types of graphs, and their significance. The book covers key terms, properties, Eulerian and Hamiltonian graphs, isomorphism, subgraphs, and special graphs such as complete and bipartite graphs.The representation of graphs is discussed highlighting their practical applications and differences. A dedicated chapter showcases the use of graphs such as search engines, networks, and bioinformatics. Various graph algorithms are detailed, including Eulerian tours, shortest paths, minimum spanning trees, maximum flow, and matching. An appendix on algorithm complexity provides insights into analyzing algorithms, time complexity.This book is ideal for undergraduate and graduate students in mathematics, computer science, engineering, and those interested in mathematical structures. It is also valuable for software engineers and developers interested in modeling systems. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9783119143721
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9783119143721
Seller: Revaluation Books, Exeter, United Kingdom
perfect. Condition: Brand New. 168 pages. 6.69x2.00x9.45 inches. In Stock. Seller Inventory # xr3119143723
Quantity: 2 available
Seller: Russell Books, Victoria, BC, Canada
perfect. Condition: New. Special order direct from the distributor. Seller Inventory # ING9783119143721
Quantity: 9 available
Seller: AussieBookSeller, Truganina, VIC, Australia
Paperback. Condition: new. Paperback. The authors passion for teaching core computer science courses, particularly discrete math and algorithms, inspired this book. Graphs are crucial in solving real-world problems, and this book aims to present graph theory gradually and accessibly. It provides a comprehensive overview of foundational and advanced concepts, starting with an introduction to graph theory, types of graphs, and their significance. The book covers key terms, properties, Eulerian and Hamiltonian graphs, isomorphism, subgraphs, and special graphs such as complete and bipartite graphs.The representation of graphs is discussed highlighting their practical applications and differences. A dedicated chapter showcases the use of graphs such as search engines, networks, and bioinformatics. Various graph algorithms are detailed, including Eulerian tours, shortest paths, minimum spanning trees, maximum flow, and matching. An appendix on algorithm complexity provides insights into analyzing algorithms, time complexity.This book is ideal for undergraduate and graduate students in mathematics, computer science, engineering, and those interested in mathematical structures. It is also valuable for software engineers and developers interested in modeling systems. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Seller Inventory # 9783119143721
Quantity: 1 available
Seller: CitiRetail, Stevenage, United Kingdom
Paperback. Condition: new. Paperback. The authors passion for teaching core computer science courses, particularly discrete math and algorithms, inspired this book. Graphs are crucial in solving real-world problems, and this book aims to present graph theory gradually and accessibly. It provides a comprehensive overview of foundational and advanced concepts, starting with an introduction to graph theory, types of graphs, and their significance. The book covers key terms, properties, Eulerian and Hamiltonian graphs, isomorphism, subgraphs, and special graphs such as complete and bipartite graphs.The representation of graphs is discussed highlighting their practical applications and differences. A dedicated chapter showcases the use of graphs such as search engines, networks, and bioinformatics. Various graph algorithms are detailed, including Eulerian tours, shortest paths, minimum spanning trees, maximum flow, and matching. An appendix on algorithm complexity provides insights into analyzing algorithms, time complexity.This book is ideal for undergraduate and graduate students in mathematics, computer science, engineering, and those interested in mathematical structures. It is also valuable for software engineers and developers interested in modeling systems. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9783119143721
Quantity: 1 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Neuware - The author's passion for teaching core computer science courses, particularly discrete math and algorithms, inspired this book. Graphs are crucial in solving real-world problems, and this book aims to present graph theory gradually and accessibly. It provides a comprehensive overview of foundational and advanced concepts, starting with an introduction to graph theory, types of graphs, and their significance. The book covers key terms, properties, Eulerian and Hamiltonian graphs, isomorphism, subgraphs, and special graphs such as complete and bipartite graphs.The representation of graphs is discussed highlighting their practical applications and differences. A dedicated chapter showcases the use of graphs such as search engines, networks, and bioinformatics. Various graph algorithms are detailed, including Eulerian tours, shortest paths, minimum spanning trees, maximum flow, and matching. An appendix on algorithm complexity provides insights into analyzing algorithms, time complexity.This book is ideal for undergraduate and graduate students in mathematics, computer science, engineering, and those interested in mathematical structures. It is also valuable for software engineers and developers interested in modeling systems. Seller Inventory # 9783119143721
Quantity: 2 available
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Graph Theory | Connectivity, Software Engineering and Bioinformatics | Aiman S. Gannous | Taschenbuch | Großformatiges Paperback. Klappenbroschur | XII | Englisch | 2026 | De Gruyter | EAN 9783119143721 | Verantwortliche Person für die EU: Walter de Gruyter GmbH, De Gruyter GmbH, Genthiner Str. 13, 10785 Berlin, productsafety[at]degruyterbrill[dot]com | Anbieter: preigu. Seller Inventory # 135632484
Quantity: 5 available