000			03062cam a2200205Ii 4500
020			_a9783030611156
020			_a3030611159
082	0	4	_a511/.1
100	1		_aErciyes, K.,
245	1	0	_aDiscrete mathematics and graph theory :
300			_a1 online resource
490	1		_aUndergraduate topics in computer science
505	0		_aPart 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 -- Pseudocode Conventions
520			_aThe 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 Uskudar University, Istanbul. 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
650		0	_aDiscrete mathematics.
856	4	0	_uhttps://rave.ohiolink.edu/ebooks/ebc2/9783030611156
856	4	0	_uhttp://link.springer.com/10.1007/978-3-030-61115-6
856	4	0	_uhttp://proxy.ohiolink.edu:9099/login?url=http://link.springer.com/10.1007/978-3-030-61115-6
942			_cBK
999			_c3506 _d3506