Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

96

Voted

NETWORKS
2002

63views Computer Networks» more NETWORKS 2002»

Light graphs with small routing cost

15 years 2 months ago

Light graphs with small routing cost

Download www.csie.ntu.edu.tw

Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang

Real-time Traffic

Computer Networks | NETWORKS 2002 |

claim paper

Related Content

» PowerCostEffective Node Architecture for LightTree Routing in WDM Networks

» Is LightTree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Network...

» Decentralized Search with Random Costs

» Using the SmallWorld Model to Improve Freenet Performance

» A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees

» A LightBased Device for Solving the Hamiltonian Path Problem

» Designing Low Cost Networks with Short Routes and Low Congestion

» Solving the Hamiltonian path problem with a lightbased computer

» Metropolis light transport

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	NETWORKS
Authors	Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang

Comments (0)