3678 search results - page 348 / 736 » On the Stable Paths Problem |
140
click to vote
EJC
2010
15 years 6 months ago
2010
We study two enumeration problems for up-down alternating trees, i.e., rooted labelled trees T, where the labels v1, v2, v3, . . . on every path starting at the root of T satisfy v...
155
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
This article is not a research paper, but a little note on the history of combinatorics: we present here a tentative short biography of Henri Delannoy, and a survey of his most no...
176
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
This note extends a recent result of Kannan, Tetali and Vempala to completely solve, via a simple proof, the problem of random generation of a labeled tournament with a given scor...
180
click to vote
TON
2002
15 years 6 months ago
2002
Multiconstrained quality-of-service (QoS) routing deals with finding routes that satisfy multiple independent QoS constraints. This problem is NP-hard. In this paper, two heuristic...
140
click to vote
IPL
2010
15 years 5 months ago
2010
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...