24 search results - page 4 / 5 » dam 1998 |
DAM
1998
14 years 11 months ago
1998
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which c...
DAM
1998
14 years 11 months ago
1998
We give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, l − 1, n − 1). The number P(k, l, n) counts noncrossing partitions of {1, 2, . . ...
DAM
2008
14 years 11 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
83
Voted
DAM
1998
14 years 11 months ago
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
88
Voted
DAM
1998
14 years 11 months ago
1998
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...