Titlebook: Structural Information and Communication Complexity; 11th International C Ratislav Královic̆,Ondrej Sýkora Conference proceedings 2004 Spri

变成小松鼠

书目名称Structural Information and Communication Complexity影响因子(影响力)




书目名称Structural Information and Communication Complexity影响因子(影响力)学科排名




书目名称Structural Information and Communication Complexity网络公开度




书目名称Structural Information and Communication Complexity网络公开度学科排名




书目名称Structural Information and Communication Complexity被引频次




书目名称Structural Information and Communication Complexity被引频次学科排名




书目名称Structural Information and Communication Complexity年度引用




书目名称Structural Information and Communication Complexity年度引用学科排名




书目名称Structural Information and Communication Complexity读者反馈




书目名称Structural Information and Communication Complexity读者反馈学科排名

使成整体

内疚

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