國立高雄大學圖資館 |

登入

回首頁

A guide to graph algorithms

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	A guide to graph algorithmsby Ton Kloks, Mingyu Xiao.
作者:	Kloks, Ton.
其他作者:	Xiao, Mingyu.
出版者:	Singapore :Springer Singapore :2022.
面頁冊數:	xv, 340 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Graph algorithms.
電子資源:	https://doi.org/10.1007/978-981-16-6350-5
ISBN:	9789811663505$q(electronic bk.)

A guide to graph algorithms
Kloks, Ton.

A guide to graph algorithms[electronic resource] /by Ton Kloks, Mingyu Xiao. - Singapore :Springer Singapore :2022. - xv, 340 p. :ill., digital ;24 cm.

Chapter 1. Graphs -- Chapter 2. Algorithms -- Chapter 3. Problem Formulations -- Chapter 4. Recent Trends.

This book A Guide to Graph Algorithms offers high-quality content in the research area of graph algorithms and explores the latest developments in graph algorithmics. The reader will gain a comprehensive understanding of how to use algorithms to explore graphs. It is a collection of texts that have proved to be trend setters and good examples of that. The book aims at providing the reader with a deep understanding of the structural properties of graphs that are useful for the design of efficient algorithms. These algorithms have applications in finite state machine modelling, social network theory, biology, and mathematics. The book contains many exercises, some up at present-day research-level. The exercises encourage the reader to discover new techniques by putting things in a clear perspective. A study of this book will provide the reader with many powerful tools to model and tackle problems in real-world scenarios.

ISBN: 9789811663505$q(electronic bk.)

Standard No.: 10.1007/978-981-16-6350-5doiSubjects--Topical Terms:

455716
Graph algorithms.

LC Class. No.: QA166.245 / .K56 2022

Dewey Class. No.: 518.1

A guide to graph algorithms
LDR:01998nmm a2200325 a 4500 001 622329
003 DE-He213
005 20220222080953.0
006 m d
007 cr nn 008maaau
008 221209s2022 si s 0 eng d
020 $a 9789811663505$q(electronic bk.)
020 $a 9789811663499$q(paper)
024 7 $a 10.1007/978-981-16-6350-5 $2 doi
035 $a 978-981-16-6350-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166.245 $b .K56 2022
072 7 $a UYA $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 518.1 $2 23
090 $a QA166.245 $b .K66 2022
100 1 $a Kloks, Ton. $3 924142
245 1 2 $a A guide to graph algorithms $h [electronic resource] / $c by Ton Kloks, Mingyu Xiao.
260 $a Singapore : $b Springer Singapore : $b Imprint: Springer, $c 2022.
300 $a xv, 340 p. : $b ill., digital ; $c 24 cm.
505 0 $a Chapter 1. Graphs -- Chapter 2. Algorithms -- Chapter 3. Problem Formulations -- Chapter 4. Recent Trends.
520 $a This book A Guide to Graph Algorithms offers high-quality content in the research area of graph algorithms and explores the latest developments in graph algorithmics. The reader will gain a comprehensive understanding of how to use algorithms to explore graphs. It is a collection of texts that have proved to be trend setters and good examples of that. The book aims at providing the reader with a deep understanding of the structural properties of graphs that are useful for the design of efficient algorithms. These algorithms have applications in finite state machine modelling, social network theory, biology, and mathematics. The book contains many exercises, some up at present-day research-level. The exercises encourage the reader to discover new techniques by putting things in a clear perspective. A study of this book will provide the reader with many powerful tools to model and tackle problems in real-world scenarios.
650 0 $a Graph algorithms. $3 455716
650 1 4 $a Design and Analysis of Algorithms. $3 913142
650 2 4 $a Graph Theory. $3 522732
650 2 4 $a Algorithms. $3 184661
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
700 1 $a Xiao, Mingyu. $3 841020
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-981-16-6350-5
950 $a Computer Science (SpringerNature-11645)