Sciweavers

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

60

Voted

TJS
2010

favoriteEmaildiscussreport

80views more TJS 2010»

Construction of vertex-disjoint paths in alternating group networks

14 years 7 months ago

Construction of vertex-disjoint paths in alternating group networks

Download www.ece.ucsb.edu

Shuming Zhou, Wenjun Xiao, Behrooz Parhami

Real-time Traffic

TJS 2010 |

claim paper

Related Content

» Approximating FaultTolerant GroupSteiner Problems

» Finding Disjoint Paths in Expanders Deterministically and Online

» Optimal Routing Between Alternate Paths With Different Network Transit Delays

» A Structured PeertoPeer Method to Discover QoS Enhanced Alternate Paths

» MARA Maximum Alternative Routing Algorithm

» Dynamical Construction of a CoreBased GroupShared Multicast Tree in Mobile Ad Hoc Networks

» Scalable Resilient Overlay Networks Using DestinationGuided Detouring

» On Failure Dependent Protection in Optical Grooming Networks

» Dynamic Path Reconfiguration Among Hybrid FSORF Nodes

Post Info
More Details (n/a)

Added	31 Jan 2011
Updated	31 Jan 2011
Type	Journal
Year	2010
Where	TJS
Authors	Shuming Zhou, Wenjun Xiao, Behrooz Parhami

Comments (0)