Sciweavers

13 search results - page 2 / 3
» Note on Bipartite Graph Tilings
Sort
View
COMBINATORICS
2006
103views more  COMBINATORICS 2006»
13 years 3 months ago
A Note on Domino Shuffling
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
É. Janvresse, T. de la Rue, Y. Velenik
DAM
2010
103views more  DAM 2010»
13 years 3 months ago
Dynamic list coloring of bipartite graphs
A dynamic coloring of a graph is a proper coloring of its vertices such that every vertex of degree more than one has at least two neighbors with distinct colors. The least number...
Louis Esperet
FOCS
2003
IEEE
13 years 9 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
ICDCS
2009
IEEE
14 years 23 days ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
COMBINATORICS
2006
130views more  COMBINATORICS 2006»
13 years 3 months ago
Fractional Biclique Covers and Partitions of Graphs
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
Valerie L. Watts