Sciweavers

1756 search results - page 72 / 352
» Directed scale-free graphs
Sort
View
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
14 years 1 months ago
On Dynamic Shortest Paths Problems
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
Liam Roditty, Uri Zwick
FORTE
1998
13 years 9 months ago
Issues in conformance testing: multiple semicontrollable interfaces
In a testing environment, where an IUT communicates with multiple entities, a tester may have di ering degrees of controllability on the interactions between these entities and th...
Mariusz A. Fecko, M. Ümit Uyar, Adarshpal S. ...
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
13 years 6 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia
WABI
2010
Springer
124views Bioinformatics» more  WABI 2010»
13 years 6 months ago
Improved Orientations of Physical Networks
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
Iftah Gamzu, Danny Segev, Roded Sharan
WWW
2007
ACM
14 years 8 months ago
Anchor-based proximity measures
We present a family of measures of proximity of an arbitrary node in a directed graph to a pre-specified subset of nodes, called the anchor. Our measures are based on three differ...
Amruta Joshi, Ravi Kumar, Benjamin Reed, Andrew To...