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...

We investigate in a simple model whether a Jastrow-based approach for a many-body system containing two-body interactions can be exact. By comparison with recent assertions to the contrary, we find that in general the exact wave function is not purely two-body correlated. Nonetheless, we show that the energy estimate obtained from the calculations is as accurate as it can possibly be, suggestin...

Basic problems of complex systems are outlined with an emphasis on irreducibility and dynamic many-to-many correspondences. We discuss the importance of a constructive approach to artificial reality and the significance of an internal observer.

We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m) time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(nm) time, where n denotes the number of people and m is the total length of the preference lists in a given instance. In addition, the algorithm and the analysis are much simpler. We also give the extensio...