國立虎尾科技大學 |

Discrete Mathematics and Graph Theory = A Concise Study Companion and Guide /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Discrete Mathematics and Graph Theory/ by K. Erciyes.
其他題名:	A Concise Study Companion and Guide /
作者:	Erciyes, K.
面頁冊數:	XVI, 336 p. 169 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Structures and Proofs. -
電子資源:	https://doi.org/10.1007/978-3-030-61115-6
ISBN:	9783030611156

Discrete Mathematics and Graph Theory = A Concise Study Companion and Guide /
Erciyes, K.

Discrete Mathematics and Graph TheoryA Concise Study Companion and Guide /[electronic resource] :by K. Erciyes. - 1st ed. 2021. - XVI, 336 p. 169 illus.online resource. - Undergraduate Topics in Computer Science,2197-1781. - Undergraduate Topics in Computer Science,.

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.

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.

ISBN: 9783030611156

Standard No.: 10.1007/978-3-030-61115-6doiSubjects--Topical Terms:

1211326
Structures and Proofs.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Discrete Mathematics and Graph Theory = A Concise Study Companion and Guide /
LDR:03862nam a22004095i 4500 001 1052472
003 DE-He213
005 20210918071555.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030611156 $9 978-3-030-61115-6
024 7 $a 10.1007/978-3-030-61115-6 $2 doi
035 $a 978-3-030-61115-6
050 4 $a QA76.9.M35
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a PBD $2 thema
072 7 $a UYAM $2 thema
082 0 4 $a 004.0151 $2 23
100 1 $a Erciyes, K. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1069227
245 1 0 $a Discrete Mathematics and Graph Theory $h [electronic resource] : $b A Concise Study Companion and Guide / $c by K. Erciyes.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XVI, 336 p. 169 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Undergraduate Topics in Computer Science, $x 2197-1781
505 0 $a 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.
520 $a 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.
650 2 4 $a Structures and Proofs. $3 1211326
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Engineering Mathematics. $3 1203947
650 2 4 $a Graph Theory. $3 786670
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 0 $a Proof theory. $3 579943
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Engineering mathematics. $3 562757
650 0 $a Graph theory. $3 527884
650 0 $a Computer science—Mathematics. $3 1253519
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030611149
776 0 8 $i Printed edition: $z 9783030611163
830 0 $a Undergraduate Topics in Computer Science, $x 1863-7310 $3 1254738
856 4 0 $u https://doi.org/10.1007/978-3-030-61115-6
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)