Sciweavers

364 search results - page 58 / 73
» Shortest-path network interdiction
Sort
View
TON
2010
158views more  TON 2010»
13 years 6 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
WEBI
2010
Springer
13 years 5 months ago
MQuery: Fast Graph Query via Semantic Indexing for Mobile Context
Mobile is becoming a ubiquitous platform for context-aware intelligent computing. One fundamental but usually ignored issue is how to efficiently manage (e.g., index and query) the...
Yuan Zhang, Ning Zhang, Jie Tang, Jinghai Rao, Wen...
BMCBI
2007
140views more  BMCBI 2007»
13 years 7 months ago
Investigations into the relationship between feedback loops and functional importance of a signal transduction network based on
Background: A number of studies on biological networks have been carried out to unravel the topological characteristics that can explain the functional importance of network nodes...
Yung-Keun Kwon, Sun Shim Choi, Kwang-Hyun Cho
NETWORKING
2004
13 years 9 months ago
Bounds on Benefits and Harms of Adding Connections to Noncooperative Networks
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
Hisao Kameda
INFOVIS
2003
IEEE
14 years 28 days ago
Visualizing Evolving Networks: Minimum Spanning Trees versus Pathfinder Networks
Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such...
Chaomei Chen, Steven Morris