Titlebook: Computational Science and Its Applications - ICCSA 2006; International Confer Marina L. Gavrilova,Osvaldo Gervasi,Hyunseung Choo Conference

flutter

Feedback Vertex Sets in Rotator Graphsscale ., which contains .! nodes. The generated set size is proved to be minimum. Finding a minimum feedback vertex set is a NP-hard problem for general graphs. The time complexity of our algorithm, which finds a minimum feedback vertex set for a rotator graph of scale ., is proved to be O(..).

黄瓜

refine

Simulation of Internet Transport Protocols for High Bandwidth-Delay Networksing work to several variants of TCP that appeared recently to improve TCP’s poor performance in high bandwidth-delay product networks. To demonstrate the usefulness of software tools developed and the new TCP hybrid models, we discuss simulation results from Internet-2 Abilene backbone.

秘传

https://doi.org/10.1007/978-3-031-58850-1s a basis for DNA comparison. It can be implemented in the CGM model with . processors in O(.) time and O(.) communication steps for an input sequence of . integers. This algorithm is based on a new optimal and very simple sequential algorithm having a time complexity of O(. log..).

hermetic

TATE

放纵

John O’M. Bockris,Shahed U. M. KhanModal failure detector . and show that to solve Election, . is the weakest failure detector to solve election when the number of faulty processes is less than ⌈./2⌉. We also show that it is strictly weaker than ..

cavity

RODE

钉牢

978-3-540-34079-9Springer-Verlag Berlin Heidelberg 2006