Titlebook: Algorithms and Computation; 22nd International S Takao Asano,Shin-ichi Nakano,Osamu Watanabe Conference proceedings 2011 Springer-Verlag Gm

只看該作者 · 發(fā)表于 2025-3-27 01:29:25

978-3-642-25590-8Springer-Verlag GmbH Berlin Heidelberg 2011

只看該作者 · 發(fā)表于 2025-3-27 05:43:39

只看該作者 · 發(fā)表于 2025-3-27 13:21:48

只看該作者 · 發(fā)表于 2025-3-27 13:37:39

Conference proceedings 2011in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for inclusion in the book. This volume contains topics such as approximation algorithms; computational geometry; computational biology; computational compl

只看該作者 · 發(fā)表于 2025-3-27 21:37:20

只看該作者 · 發(fā)表于 2025-3-28 00:10:19

只看該作者 · 發(fā)表于 2025-3-28 05:24:13

只看該作者 · 發(fā)表于 2025-3-28 08:06:44

只看該作者 · 發(fā)表于 2025-3-28 10:26:54

https://doi.org/10.1007/978-3-662-34644-0ph is chordal. We use this result to show that, for any fixed graph ., the problems .-. and .-. can be solved in polynomial time on chordal graphs. These problems are to decide whether an input graph . contains . as a contraction or as an induced minor, respectively.

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛(ài)論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-22 16:05
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved