Agents with single-peaked preferences share a resource coming from different suppliers; each agent is connected to only a subset of suppliers. Examples include workload balancing, sharing earmarked funds, and rationing utilities after a storm.

Network-based recommendation algorithms for user–object link predictions have achieved significant developments in recent years. For bipartite graphs, the resource reallocation in such algorithms is analogous to heat spreading (HeatS) or probability spreading (ProbS) processes. The best...

We investigate the distribution of flavonoids, a major category of plant secondary metabolites, across species. Flavonoids are known to show high species specificity, and were once considered as chemical markers for understanding adaptive evolution and characterization of living organisms. We...

We propose describing a kind of cooperation–competition systems by node-weighted bipartite graphs. In such systems the nodes can be divided into two types. One expresses a kind of activities, organizations or events, named “acts”; and another expresses the “actors” participating in...

We consider the problem of minimizing the makespan on a batch processing machine, in which jobs are not all compatible. Only compatible jobs can be included into the same batch. This relation of compatibility is represented by a graph (called compatibility graph), which is assumed to be...

We consider the problem of minimizing the makespan on a batch processing machine, in which jobs are not all compatible. Only compatible jobs can be included into the same batch. This relation of compatibility is represented by a graph (called compatibility graph), which is assumed to be...