000 | 04625nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-030-61115-6 | ||
003 | DE-He213 | ||
005 | 20240423125357.0 | ||
007 | cr nn 008mamaa | ||
008 | 210128s2021 sz | s |||| 0|eng d | ||
020 |
_a9783030611156 _9978-3-030-61115-6 |
||
024 | 7 |
_a10.1007/978-3-030-61115-6 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
050 | 4 | _aQA297.4 | |
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aPBD _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYAM _2thema |
|
072 | 7 |
_aPBD _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
100 | 1 |
_aErciyes, K. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
245 | 1 | 0 |
_aDiscrete Mathematics and Graph Theory _h[electronic resource] : _bA Concise Study Companion and Guide / _cby K. Erciyes. |
250 | _a1st ed. 2021. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2021. |
|
300 |
_aXVI, 336 p. 169 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aUndergraduate Topics in Computer Science, _x2197-1781 |
|
505 | 0 | _aPreface -- 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. | |
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 Ü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. | ||
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aGraph theory. | |
650 | 0 | _aEngineering mathematics. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aProof theory. | |
650 | 1 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aGraph Theory. |
650 | 2 | 4 | _aEngineering Mathematics. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aProof Theory and Constructive Mathematics. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030611149 |
776 | 0 | 8 |
_iPrinted edition: _z9783030611163 |
830 | 0 |
_aUndergraduate Topics in Computer Science, _x2197-1781 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-61115-6 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
942 | _cSPRINGER | ||
999 |
_c177285 _d177285 |