| 書目名稱 | Computational Graph Theory | | 編輯 | G. Tinhofer,E. Mayr,M. M. Syslo | | 視頻video | http://file.papertrans.cn/233/232342/232342.mp4 | | 叢書名稱 | Computing Supplementa | | 圖書封面 |  | | 描述 | One ofthe most important aspects in research fields where mathematics is "applied is the construction of a formal model of a real system. As for structural relations, graphs have turned out to provide the most appropriate tool for setting up the mathematical model. This is certainly one of the reasons for the rapid expansion in graph theory during the last decades. Furthermore, in recent years it also became clear that the two disciplines of graph theory and computer science have very much in common, and that each one has been capable of assisting significantly in the development of the other. On one hand, graph theorists have found that many of their problems can be solved by the use of com- puting techniques, and on the other hand, computer scientists have realized that many of their concepts, with which they have to deal, may be conveniently expressed in the lan- guage of graph theory, and that standard results in graph theory are often very relevant to the solution of problems concerning them. As a consequence, a tremendous number of publications has appeared, dealing with graphtheoretical problems from a computational point of view or treating computational problems using grap | | 出版日期 | Book 1990 | | 關(guān)鍵詞 | Layout; algorithms; calculus; computational graph theory; graph theory; graphs; network; combinatorics | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-7091-9076-0 | | isbn_softcover | 978-3-211-82177-0 | | isbn_ebook | 978-3-7091-9076-0Series ISSN 0344-8029 | | issn_series | 0344-8029 | | copyright | Springer-Verlag/Wien 1990 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-1-31 02:25
發(fā)表于 2025-3-21 20:06:33
