找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Combinatorial Algorithms; 20th International W Ji?í Fiala,Jan Kratochvíl,Mirka Miller Conference proceedings 2009 Springer-Verlag Berlin He

[復(fù)制鏈接]
查看: 14984|回復(fù): 67
樓主
發(fā)表于 2025-3-21 17:48:39 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Combinatorial Algorithms
副標(biāo)題20th International W
編輯Ji?í Fiala,Jan Kratochvíl,Mirka Miller
視頻videohttp://file.papertrans.cn/230/229885/229885.mp4
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Combinatorial Algorithms; 20th International W Ji?í Fiala,Jan Kratochvíl,Mirka Miller Conference proceedings 2009 Springer-Verlag Berlin He
描述This book constitutes the revised selected papers of the 20th International Workshop on Combinatorial Algorithms, held in June/July 2009 in the castle of Hradec nad Moravicí, Czech Republic. The 41 papers included in this volume together with 5 invited papers were carefully reviewed and selected from over 100 submissions. The topics dealt with are algorithms and data structures, applications, combinatorial enumeration, combinatorial optimization, complexity theory, computational biology, databases, decompositions and combinatorial designs, discrete and computational geometry, including graph drawing, and graph theory and combinatorics.
出版日期Conference proceedings 2009
關(guān)鍵詞Graph; Graph theory; algorithms; combinatorial optimization; combinatorics; complexity; computational geom
版次1
doihttps://doi.org/10.1007/978-3-642-10217-2
isbn_softcover978-3-642-10216-5
isbn_ebook978-3-642-10217-2Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2009
The information of publication is updating

書目名稱Combinatorial Algorithms影響因子(影響力)




書目名稱Combinatorial Algorithms影響因子(影響力)學(xué)科排名




書目名稱Combinatorial Algorithms網(wǎng)絡(luò)公開度




書目名稱Combinatorial Algorithms網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Combinatorial Algorithms被引頻次




書目名稱Combinatorial Algorithms被引頻次學(xué)科排名




書目名稱Combinatorial Algorithms年度引用




書目名稱Combinatorial Algorithms年度引用學(xué)科排名




書目名稱Combinatorial Algorithms讀者反饋




書目名稱Combinatorial Algorithms讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

1票 100.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:41:27 | 只看該作者
板凳
發(fā)表于 2025-3-22 03:18:31 | 只看該作者
Edge-Simple Circuits through 10 Ordered Vertices in Square Grids
地板
發(fā)表于 2025-3-22 08:28:26 | 只看該作者
Evaluation of Recoverable-Robust Timetables on Tree Networkstimetable is measured by the ., i.e. the ratio between the cost of the robust timetable and that of a non-robust optimal timetable. The considered problem is known to be .-hard. We propose a pseudo-polynomial time algorithm and apply it on random networks and real case scenarios provided by Italian
5#
發(fā)表于 2025-3-22 08:44:42 | 只看該作者
6#
發(fā)表于 2025-3-22 14:48:08 | 只看該作者
7#
發(fā)表于 2025-3-22 19:22:19 | 只看該作者
978-3-642-10216-5Springer-Verlag Berlin Heidelberg 2009
8#
發(fā)表于 2025-3-22 21:50:48 | 只看該作者
https://doi.org/10.1007/978-3-540-32350-1This paper reports on three recent research directions that begin to explore the subject of fully multivariate algorithmics, meaning by this the largely uncharted theoretical landscape that lies beyond parameterized complexity and algorithmics — itself a natural two-dimensional generalization of the familiar one-dimensional framework of ....
9#
發(fā)表于 2025-3-23 03:55:30 | 只看該作者
https://doi.org/10.1007/3-540-29142-3The fixed parameter tractability (FPT) approach pioneered by Downey and Fellows provides an algorithm design philosophy for solving special cases of intractable problems. Here we review several examples from geometry and graph drawing, in particular layered graph drawing, that illustrate fixed parameter tractability techniques.
10#
發(fā)表于 2025-3-23 06:43:57 | 只看該作者
Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter EcologyThis paper reports on three recent research directions that begin to explore the subject of fully multivariate algorithmics, meaning by this the largely uncharted theoretical landscape that lies beyond parameterized complexity and algorithmics — itself a natural two-dimensional generalization of the familiar one-dimensional framework of ....
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-12 16:35
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
成武县| 迭部县| 来安县| 元江| 和林格尔县| 明溪县| 大埔县| 临清市| 平舆县| 阿鲁科尔沁旗| 东平县| 荆州市| 乌拉特前旗| 萍乡市| 云林县| 安顺市| 凯里市| 镇赉县| 突泉县| 五华县| 南投县| 剑河县| 友谊县| 中牟县| 雅安市| 中宁县| 高淳县| 蕲春县| 虞城县| 清水县| 房山区| 开化县| 广饶县| 开江县| 科尔| 澜沧| 无为县| 兴宁市| 云安县| 荣昌县| 凤冈县|