A paired many-to-many k-disjoint path cover (k-DPC for short) of a graph is a set of k disjoint paths joining k distinct source-sink pairs that cover all the vertices of the graph. Extending the notion of DPC, we define a paired many-to-many bipartite k-DPC of a bipartite graph G to be a set of k disjoint paths joining k distinct source-sink pairs that altogether cover the same number of vertic...

Previous research shows that human learners can acquire word-referent pairs over a short series of individually ambiguous situations each containing multiple words and referents (Yu & Smith, 2007). In this kind of cross-situational statistical learning based on the repeated co-occurrence of words with their intended referents, the application of principles such as mutual exclusivity and contras...

This paper deals with a long distance routing problem. The aim is to improve the use of the resources in order to reduce the distance. In this way of transport are known three kinds of pure distribution strategies: many to many, the trips are full truckload or the time restrictions are very tight, so they are direct shipments; the second one is known as peddling, in this case, closed collecting...