3678 search results - page 242 / 736 » On the Stable Paths Problem |
112
Voted
RTA
1993
Springer
15 years 9 months ago
1993
Springer
Abstract. We generalize the various path orderings and the conditions under which they work, and describe an implementation of this general ordering. We look at methods for proving...
119
Voted
DM
2008
15 years 5 months ago
2008
One proves that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen in [7] (see also [10]), are top intersection numbers in the cohomology ring of...
140
Voted
COMBINATORICS
2000
15 years 4 months ago
2000
A counterexample is presented to Gy. Elekes's conjecture concerning the existence of long 2-colored paths in properly colored graphs. A modified version of the conjecture is ...
155
click to vote
ICDCSW
2009
IEEE
15 years 11 months ago
2009
IEEE
Applications in mobile ad-hoc networks can suffer from poor link quality and degraded network services. In particular, standard TCP over low-quality, long routing paths, can have ...
149
Voted
IMC
2005
ACM
15 years 10 months ago
2005
ACM
Recent progress in active measurement techniques has made it possible to estimate end-to-end path available bandwidth. However, how to efficiently obtain available bandwidth info...