Blandishment 发表于 2025-3-21 18:52:34

书目名称Algorithms - ESA ‘93影响因子(影响力)<br>        http://figure.impactfactor.cn/if/?ISSN=BK0153310<br><br>        <br><br>书目名称Algorithms - ESA ‘93影响因子(影响力)学科排名<br>        http://figure.impactfactor.cn/ifr/?ISSN=BK0153310<br><br>        <br><br>书目名称Algorithms - ESA ‘93网络公开度<br>        http://figure.impactfactor.cn/at/?ISSN=BK0153310<br><br>        <br><br>书目名称Algorithms - ESA ‘93网络公开度学科排名<br>        http://figure.impactfactor.cn/atr/?ISSN=BK0153310<br><br>        <br><br>书目名称Algorithms - ESA ‘93被引频次<br>        http://figure.impactfactor.cn/tc/?ISSN=BK0153310<br><br>        <br><br>书目名称Algorithms - ESA ‘93被引频次学科排名<br>        http://figure.impactfactor.cn/tcr/?ISSN=BK0153310<br><br>        <br><br>书目名称Algorithms - ESA ‘93年度引用<br>        http://figure.impactfactor.cn/ii/?ISSN=BK0153310<br><br>        <br><br>书目名称Algorithms - ESA ‘93年度引用学科排名<br>        http://figure.impactfactor.cn/iir/?ISSN=BK0153310<br><br>        <br><br>书目名称Algorithms - ESA ‘93读者反馈<br>        http://figure.impactfactor.cn/5y/?ISSN=BK0153310<br><br>        <br><br>书目名称Algorithms - ESA ‘93读者反馈学科排名<br>        http://figure.impactfactor.cn/5yr/?ISSN=BK0153310<br><br>        <br><br>

insular 发表于 2025-3-21 21:44:08

http://reply.papertrans.cn/16/1534/153310/153310_2.png

ADORE 发表于 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.

返老还童 发表于 2025-3-22 07:12:25

http://reply.papertrans.cn/16/1534/153310/153310_4.png

领巾 发表于 2025-3-22 12:22:06

http://reply.papertrans.cn/16/1534/153310/153310_5.png

一条卷发 发表于 2025-3-22 16:46:14

http://reply.papertrans.cn/16/1534/153310/153310_6.png

STELL 发表于 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:

LINE 发表于 2025-3-23 00:40:47

http://reply.papertrans.cn/16/1534/153310/153310_8.png

Parley 发表于 2025-3-23 04:04:06

http://reply.papertrans.cn/16/1534/153310/153310_9.png

GORGE 发表于 2025-3-23 08:36:27

http://reply.papertrans.cn/16/1534/153310/153310_10.png
页: [1] 2 3 4 5 6 7
查看完整版本: Titlebook: Algorithms - ESA ‘93; First Annual Europea Thomas Lengauer Conference proceedings 1993 Springer-Verlag Berlin Heidelberg 1993 Algorithmen.A