DAM
2010
13 years 9 months ago
2010
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
DAM
2010
13 years 9 months ago
2010
DAM
2010
13 years 9 months ago
2010
DAM
2010
13 years 9 months ago
2010
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2...
DAM
2010
13 years 9 months ago
2010
DAM
2010
13 years 9 months ago
2010
DAM
2010
13 years 9 months ago
2010
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
DAM
2010
13 years 9 months ago
2010
We consider the process of cleaning a network where at each time step, all vertices that have at least as many brushes as incident, contaminated edges, send brushes down these edg...
DAM
2010
13 years 9 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
DAM
2010
13 years 9 months ago
2010