| 書目名稱 | Combinatorial Algorithms |
| 副標(biāo)題 | 21st International W |
| 編輯 | Costas S. Iliopoulos,William F. Smyth |
| 視頻video | http://file.papertrans.cn/230/229878/229878.mp4 |
| 概述 | High quality selected papers.Unique visibility.State of the art research |
| 叢書名稱 | Lecture Notes in Computer Science |
| 圖書封面 |  |
| 描述 | This book constitutes the thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010. .The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinatorial graph algorithms for the computations of various graph features are presented; also algorithms for network compuation, approximation, computational geometry, games, and search are presented and complexity aspects of such algorithms are discussed. |
| 出版日期 | Conference proceedings 2011 |
| 關(guān)鍵詞 | combinatorial enumeration; computational complexity; graph coloring; graph labeling; hypergraphs; matrix |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-19222-7 |
| isbn_softcover | 978-3-642-19221-0 |
| isbn_ebook | 978-3-642-19222-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer Berlin Heidelberg 2011 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-14 06:10
發(fā)表于 2025-3-21 17:40:35
