000 | 02865nam a22005415i 4500 | ||
---|---|---|---|
001 | 978-981-16-6350-5 | ||
003 | DE-He213 | ||
005 | 20240423125546.0 | ||
007 | cr nn 008mamaa | ||
008 | 220222s2022 si | s |||| 0|eng d | ||
020 |
_a9789811663505 _9978-981-16-6350-5 |
||
024 | 7 |
_a10.1007/978-981-16-6350-5 _2doi |
|
050 | 4 | _aQA9.58 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a005.13 _223 |
100 | 1 |
_aKloks, Ton. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
245 | 1 | 2 |
_aA Guide to Graph Algorithms _h[electronic resource] / _cby Ton Kloks, Mingyu Xiao. |
250 | _a1st ed. 2022. | ||
264 | 1 |
_aSingapore : _bSpringer Nature Singapore : _bImprint: Springer, _c2022. |
|
300 |
_aXV, 340 p. 1 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
505 | 0 | _aChapter 1. Graphs -- Chapter 2. Algorithms -- Chapter 3. Problem Formulations -- Chapter 4. Recent Trends. | |
520 | _aThis 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 | _aAlgorithms. | |
650 | 0 | _aGraph theory. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 1 | 4 | _aDesign and Analysis of Algorithms. |
650 | 2 | 4 | _aGraph Theory. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
700 | 1 |
_aXiao, Mingyu. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9789811663499 |
776 | 0 | 8 |
_iPrinted edition: _z9789811663512 |
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-981-16-6350-5 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
942 | _cSPRINGER | ||
999 |
_c179273 _d179273 |