Titlebook: Structural Information and Communication Complexity; 11th International C Ratislav Královic?,Ondrej Sykora Conference proceedings 2004 Spri

變成小松鼠

書目名稱Structural Information and Communication Complexity影響因子(影響力)




書目名稱Structural Information and Communication Complexity影響因子(影響力)學(xué)科排名




書目名稱Structural Information and Communication Complexity網(wǎng)絡(luò)公開度




書目名稱Structural Information and Communication Complexity網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Structural Information and Communication Complexity被引頻次




書目名稱Structural Information and Communication Complexity被引頻次學(xué)科排名




書目名稱Structural Information and Communication Complexity年度引用




書目名稱Structural Information and Communication Complexity年度引用學(xué)科排名




書目名稱Structural Information and Communication Complexity讀者反饋




書目名稱Structural Information and Communication Complexity讀者反饋學(xué)科排名

使成整體

內(nèi)疚

Myelin

Two-Hop Virtual Path Layout in Tori,ion (the congestion is the maximum load of a physical link). Here we propose a method to solve this problem when the diameter is 2. We use this method to give an asymptotically optimal solution for the 2-hop virtual path layout problem for all-to-all traffic when the physical network is a mesh, a torus or a chordal ring.

aneurysm

Sparse Additive Spanners for Bounded Tree-Length Graphs,dges. This provides new upper bounds for chordal graphs for which .=1. We also show a lower bound, and prove that there are graphs of tree-length . for which every multiplicative .-spanner (and thus every additive (.–1)-spanner) requires Ω(. .) edges.

不可侵犯

主講人

ERUPT

defray

Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks,of the network. Face routing guarantees message delivery in networks that contains large holes, where greedy algorithms fail. Existing techniques for constructing a suitable planar subgraph involve local tests that eliminate crossings between existing links by deleting some links. They do not test w

樣式

Path Layout on Tree Networks: Bounds in Different Label Switching Models,col and MPLS which is a new label switching protocol standardized recently by the IETF. Path layout is essentially the problem of reducing the size of the label-table in a router. The size is equivalent to the number of different paths that pass through the router, or start from it. A reduction in t