Sciweavers

169 search results - page 4 / 34
» Counting paths in digraphs
Sort
View
SIAMDM
1998
53views more  SIAMDM 1998»
15 years 6 months ago
Two Arc-Disjoint Paths in Eulerian Digraphs
András Frank, Toshihide Ibaraki, Hiroshi Na...
INFOCOM
2007
IEEE
16 years 29 days ago
Moore: An Extendable Peer-to-Peer Network Based on Incomplete Kautz Digraph with Constant Degree
— The topological properties of peer-to-peer overlay networks are critical factors that dominate the performance of these systems. Several non-constant and constant degree interc...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
147
Voted
ICN
2001
Springer
15 years 11 months ago
Virtual Path Layout in ATM Path with Given Hop Count
Sébastien Choplin
INFOCOM
2010
IEEE
15 years 5 months ago
Random Walks on Digraphs: A Theoretical Framework for Estimating Transmission Costs in Wireless Routing
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...
Yanhua Li, Zhi-Li Zhang
CORR
2010
Springer
164views Education» more  CORR 2010»
15 years 6 months ago
Performance Comparison of Link, Node and Zone Disjoint Multi-path Routing Strategies and Minimum Hop Single Path Routing for Mob
The high-level contribution of this paper is a simulation-based analysis to evaluate the tradeoffs between lifetime and hop count of link-disjoint, node-disjoint and zone-disjoint...
Natarajan Meghanathan