144 search results - page 27 / 29 » Path extendability of claw-free graphs |
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Network routing may be required, under certain applications, to avoid certain areas (or nodes) These areas can be of potential security threat, possess poor quality or have other ...
SIGMETRICS
2006
ACM
15 years 3 months ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
ECMDAFA
2005
Springer
15 years 3 months ago
2005
Springer
This article presents a control flow analysis methodology based on UML 2.0 sequence diagrams (SD). In contrast to the conventional code-based control flow analysis techniques, thi...
RECOMB
2003
Springer
15 years 10 months ago
2003
Springer
We develop a new framework for inferring models of transcriptional regulation. The models in this approach, which we call physical models, are constructed on the basis of verifiab...
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...