Cantitate/Preț
Produs
Total produse
Vezi coșul
Discrete Mathematics and Graph Theory: A Concise Study Companion and Guide de K. Erciyes

Discrete Mathematics and Graph Theory: A Concise Study Companion and Guide: Undergraduate Topics in Computer Science

Autor K. Erciyes
en Limba Engleză Paperback – 29 ian 2021
This textbook can serve as a comprehensive manual of discrete mathematics and graph theory for non-Computer Science majors; as a reference and study aid for professionals and researchers who have not taken any discrete math course before. It can also be used as a reference book for a course on Discrete Mathematics in Computer Science or Mathematics curricula.
The study of discrete mathematics is one of the first courses on curricula in various disciplines such as Computer Science, Mathematics and Engineering education practices.
Graphs are key data structures used to represent networks, chemical structures, games etc. and are increasingly used more in various applications such as bioinformatics and the Internet. Graph theory has gone through an unprecedented growth in the last few decades both in terms of theory and implementations; hence it deserves a thorough treatment which is not adequately found in any other contemporary books on discrete mathematics, whereas about 40% of this textbook is devoted to graph theory.
The text follows an algorithmic approach for discrete mathematics and graph problems where applicable, to reinforce learning and to show how to implement the concepts in real-world applications.
Citește tot Restrânge

Din seria Undergraduate Topics in Computer Science

Preț: 22664 lei

Preț vechi: 28330 lei
-20% Nou

Puncte Express: 340
Preț estimativ în valută:
4337€ • 4501$ • 3625£

Carte disponibilă

Livrare economică 22 februarie-08 martie
Livrare express 08-14 februarie pentru 3263 lei

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030611149
ISBN-10: 3030611140
Pagini: 336
Ilustrații: XVI, 336 p. 169 illus.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.49 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seria Undergraduate Topics in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Preface.- Part I: Fundamentals of Discrete Mathematics.- Logic.- Proofs.- Algorithms.- Set Theory.- Relations and Functions.- Sequences, Induction and Recursion.- Introduction to Number Theory.- Counting and Probability.- Boolean Algebra and Combinational Circuits.- Introduction to the Theory of Computation.- Part II: Graph Theory.- Introduction to Graphs.- Trees and Traversals.- Subgraphs.- Connectivity, Network Flows and Shortest Paths.- Graph Applications.- A:.- Pseudocode Conventions.- Index.

Recenzii

“This accessible reference book should be well received by undergraduate-level CS, engineering, and mathematics students.” (Soubhik Chakraborty, Computing Reviews, July 12, 2022)

“The book under review is an elementary introduction to mathematical logic, set theory, discrete mathematics, number theory, probability theory and graph theory. Its undoubted advantage is its good algorithmic support. … I would recommend this book to students studying computer science at the bachelor’s level.” (I. M. Erusalimskiy, zbMATH 1477.68004, 2022)

Notă biografică

Dr. Kayhan Erciyes is a full Professor in the Department of Computer Engineering at Üsküdar University, Istanbul, Turkey. His other publications include the Springer titles Distributed Real-Time Systems, Guide to Graph Algorithms, Distributed and Sequential Algorithms for Bioinformatics, and Distributed Graph Algorithms for Computer Networks.

Textul de pe ultima copertă

The study of discrete mathematics is one of the first courses on curricula in various educational disciplines such as Computer Science, Mathematics and Engineering.
Graphs are key data structures used to represent networks, chemical structures, games etc. and are increasingly used more in various applications such as bioinformatics and the Internet. Graph theory has gone through an unprecedented growth in the last few decades both in terms of theory and implementations; hence it deserves a thorough treatment which is not adequately found in any other contemporary books on discrete mathematics, whereas about 40% of this textbook is devoted to graph theory.
Employing an algorithmic approach, this clearly structured textbook/reference presents a comprehensive review of the fundamental principles of discrete mathematics with emphasis on graph theory. It aims to be a study companion and a guide for discrete mathematics and graph theory.
Topics and features:
  • Provides a detailed and concise review of the main concepts of discrete mathematics
  • Presents a focus on graph theory concepts
  • Surveys main algorithmic methods
  • Employs algorithmic solutions to many discrete math and graph theory problems
  • Includes chapter summaries, end-of-chapter review questions, numerous examples, and exercises
This unique textbook can serve as a comprehensive manual of discrete mathematics and graph theory for Computer Science or non-CS majors. In addition, its easy-to-read chapters, filled with examples, make it a highly useful reference and study aid for professionals and researchers who have not taken any discrete math course previously.
Dr. K. Erciyes is a professor of Computer Engineering at Üsküdar University, İstanbul. His other publications include the Springer titles Distributed Graph Algorithms for Computer Networks, Distributed and Sequential Algorithms for Bioinformatics, Guide to Graph Algorithms and Distributed Real-Time Systems.

Caracteristici

Provides a detailed, thorough, and comprehensive review of concepts in discrete mathematics and graph theory Includes an introductory chapter on algorithms, and presents numerous concepts using algorithmic notation, where applicable Accessible enough to serve as a quick reference even for undergraduate students of disciplines other than computer science