JCT
1998
13 years 10 months ago
1998
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
IPL
2006
13 years 10 months ago
2006
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality ...
DAM
2010
13 years 11 months ago
2010
We present an algorithm which given a source node and a set of n - 1 target nodes in the (n, k)-star graph Sn,k, where all nodes are distinct, builds a collection of n - 1 node-di...
HICSS
2002
IEEE
14 years 3 months ago
2002
IEEE
In this paper we consider a multipath extension to the dynamic source routing (DSR) protocol proposed by Johnson and Maltz, an on-demand routing protocol for ad hoc wireless netwo...
CPAIOR
2007
Springer
14 years 5 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...