| 書(shū)目名稱(chēng) | Path Problems in Networks | | 編輯 | John S. Baras,George Theodorakopoulos | | 視頻video | http://file.papertrans.cn/743/742071/742071.mp4 | | 叢書(shū)名稱(chēng) | Synthesis Lectures on Learning, Networks, and Algorithms | | 圖書(shū)封面 |  | | 描述 | The algebraic path problem is a generalization of the shortest path problem in graphs. Various instances of this abstract problem have appeared in the literature, and similar solutions have been independently discovered and rediscovered. The repeated appearance of a problem is evidence of its relevance. This book aims to help current and future researchers add this powerful tool to their arsenal, so that they can easily identify and use it in their own work. Path problems in networks can be conceptually divided into two parts: A distillation of the extensive theory behind the algebraic path problem, and an exposition of a broad range of applications. First of all, the shortest path problem is presented so as to fix terminology and concepts: existence and uniqueness of solutions, robustness to parameter changes, and centralized and distributed computation algorithms. Then, these concepts are generalized to the algebraic context of semirings. Methods for creating new semirings, useful for modeling new problems, are provided. A large part of the book is then devoted to numerous applications of the algebraic path problem, ranging from mobile network routing to BGP routing to social net | | 出版日期 | Book 2010 | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-031-79983-9 | | isbn_softcover | 978-3-031-79982-2 | | isbn_ebook | 978-3-031-79983-9Series ISSN 2690-4306 Series E-ISSN 2690-4314 | | issn_series | 2690-4306 | | copyright | Springer Nature Switzerland AG 2010 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-24 17:45
發(fā)表于 2025-3-21 17:29:25
