找回密碼
 To register

QQ登錄

只需一步，快速開(kāi)始

掃一掃，訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Algorithms - ESA ‘93; First Annual Europea Thomas Lengauer Conference proceedings 1993 Springer-Verlag Berlin Heidelberg 1993 Algorithmen.A

[復(fù)制鏈接]
查看: 43867|回復(fù): 63
樓主
發(fā)表于 2025-3-21 18:52:34 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
期刊全稱Algorithms - ESA ‘93
期刊簡(jiǎn)稱First Annual Europea
影響因子2023Thomas Lengauer
視頻videohttp://file.papertrans.cn/154/153310/153310.mp4
學(xué)科分類Lecture Notes in Computer Science
圖書封面Titlebook: Algorithms - ESA ‘93; First Annual Europea Thomas Lengauer Conference proceedings 1993 Springer-Verlag Berlin Heidelberg 1993 Algorithmen.A
影響因子Symposium on Algorithms (ESA ‘93), held in Bad Honnef, nearBoon, inGermany, September 30 - October 2, 1993. Thesymposium is intended to launchan annual series ofinternational conferences, held in early fall, covering thefield of algorithms. Within the scope of the symposium liesall research on algorithms, theoretical as well as applied,that is carried out in the fields of computer science anddiscrete applied mathematics. The symposium aims to cater toboth of these research communities and tointensify theexchange between them.The volume contains 35 contributed papers selected from 101proposals submitted in response to the call forpapers, aswell as three invited lectures: "Evolution of an algorithm"by Michael Paterson, "Complexity of disjoint paths problemsin planar graphs" by Alexander Schrijver, and"Sequencecomparison and statistical significance in molecularbiology" by Michael S. Waterman.
Pindex Conference proceedings 1993
The information of publication is updating

書目名稱Algorithms - ESA ‘93影響因子(影響力)




書目名稱Algorithms - ESA ‘93影響因子(影響力)學(xué)科排名




書目名稱Algorithms - ESA ‘93網(wǎng)絡(luò)公開(kāi)度




書目名稱Algorithms - ESA ‘93網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書目名稱Algorithms - ESA ‘93被引頻次




書目名稱Algorithms - ESA ‘93被引頻次學(xué)科排名




書目名稱Algorithms - ESA ‘93年度引用




書目名稱Algorithms - ESA ‘93年度引用學(xué)科排名




書目名稱Algorithms - ESA ‘93讀者反饋




書目名稱Algorithms - ESA ‘93讀者反饋學(xué)科排名




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

0票 0%

Perfect with Aesthetics
 

0票 0%

Better Implies Difficulty
 

0票 0%

Good and Satisfactory
 

0票 0%

Adverse Performance
 

0票 0%

Disdainful Garbage
您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:44:08 | 只看該作者
板凳
發(fā)表于 2025-3-22 00:26:09 | 只看該作者
Parallel approximation schemes for problems on planar graphs,This paper describes a technique to obtain NC Approximations Schemes for the Maximun Independent Set in planar graphs and related optimization problems.
地板
發(fā)表于 2025-3-22 07:12:25 | 只看該作者
5#
發(fā)表于 2025-3-22 12:22:06 | 只看該作者
6#
發(fā)表于 2025-3-22 16:46:14 | 只看該作者
7#
發(fā)表于 2025-3-22 20:33:59 | 只看該作者
Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs,e communication step are investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). Here, the complexity of gossiping in grids and in planar graphs is investigated. The main results are the following:
8#
發(fā)表于 2025-3-23 00:40:47 | 只看該作者
9#
發(fā)表于 2025-3-23 04:04:06 | 只看該作者
10#
發(fā)表于 2025-3-23 08:36:27 | 只看該作者
 關(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.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-7 23:23
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
怀仁县| 峨眉山市| 乌恰县| 南召县| 北安市| 宁安市| 道真| 商南县| 上虞市| 三都| 宁都县| 永济市| 龙川县| 沙河市| 衡山县| 临洮县| 苏尼特左旗| 金川县| 玉环县| 新安县| 布拖县| 芒康县| 土默特右旗| 璧山县| 乃东县| 始兴县| 攀枝花市| 贵阳市| 兴业县| 阳江市| 福清市| 崇仁县| 广元市| 西充县| 登封市| 阳原县| 林周县| 襄城县| 综艺| 贵州省| 平陆县|