001444641 000__ 02614cam\a2200469Ia\4500
001444641 001__ 1444641
001444641 003__ OCoLC
001444641 005__ 20230310003720.0
001444641 006__ m\\\\\o\\d\\\\\\\\
001444641 007__ cr\un\nnnunnun
001444641 008__ 220224s2022\\\\si\\\\\\ob\\\\001\0\eng\d
001444641 019__ $$a1299301521$$a1299367096$$a1299379917$$a1299387747$$a1299443816$$a1302007303
001444641 020__ $$a9789811663505$$q(electronic bk.)
001444641 020__ $$a9811663505$$q(electronic bk.)
001444641 020__ $$z9811663491
001444641 020__ $$z9789811663499
001444641 0247_ $$a10.1007/978-981-16-6350-5$$2doi
001444641 035__ $$aSP(OCoLC)1299275148
001444641 040__ $$aYDX$$beng$$cYDX$$dGW5XE$$dEBLCP$$dOCLCO$$dOCLCF$$dUKAHL$$dOCLCQ
001444641 049__ $$aISEA
001444641 050_4 $$aQA166.245
001444641 08204 $$a518/.1$$223
001444641 1001_ $$aKloks, Ton.
001444641 24512 $$aA guide to graph algorithms /$$cTon Kloks, Mingyu Xiao.
001444641 260__ $$aSingapore :$$bSpringer,$$c2022.
001444641 300__ $$a1 online resource
001444641 504__ $$aIncludes bibliographical references and index.
001444641 5050_ $$aChapter 1. Graphs -- Chapter 2. Algorithms -- Chapter 3. Problem Formulations -- Chapter 4. Recent Trends.
001444641 506__ $$aAccess limited to authorized users.
001444641 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.
001444641 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed March 9, 2022).
001444641 650_0 $$aGraph algorithms.
001444641 650_6 $$aAlgorithmes de graphes.
001444641 655_0 $$aElectronic books.
001444641 7001_ $$aXiao, Mingyu.
001444641 77608 $$iPrint version: $$z9811663491$$z9789811663499$$w(OCoLC)1264712703
001444641 852__ $$bebk
001444641 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-981-16-6350-5$$zOnline Access$$91397441.1
001444641 909CO $$ooai:library.usi.edu:1444641$$pGLOBAL_SET
001444641 980__ $$aBIB
001444641 980__ $$aEBOOK
001444641 982__ $$aEbook
001444641 983__ $$aOnline
001444641 994__ $$a92$$bISE