000 04015nam a2200397 i 4500
999 _c334793
_d334793
_x1
001 334793
003 ES-MaUEC
005 20230102114748.0
006 a|||| o|||| 00| 0
007 cr nn nnnaamaa
008 210128s2021 gw a o |||| 0|eng d
020 _a9783030611156
024 7 _a10.1007/978-3-030-61115-6
_2doi
040 _aES-MaUEC
_bspa
_cES-MaUEC
_dES-MaUEC
050 4 _aQA76.9.M35 
_b2021 EB
100 1 _aErciyes, K.
_eautor
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_9678848
245 1 0 _aDiscrete Mathematics and Graph Theory :
_bA Concise Study Companion and Guide
_cby K Erciyes
250 _aFirst edition 2021
264 1 _aCham, Switzerland
_bSpringer International Publising
_c2021
300 _a1 recurso en línea (XVI, 336 páginas)
_b169 ilustraciones
336 _2rdacontent
_aTexto
_btxt
337 _2rdamedia
_aelectrónico
_bc
338 _2rdacarrier
_arecurso electrónico
_bcr
347 _atext file
_bPDF
_2rda
490 0 _aUndergraduate Topics in Computer Science
_x1863-7310
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 3 _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.
988 _aSpringer_Computer_2021
650 7 _2embne
_aMatemáticas discretas
_9160233
710 2 _aSpringerLink
856 4 0 _uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-61115-6
_zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942 _2lcc
_cLE
998 _b05/2021
_dz
_eb
_zSI