15 search results - page 2 / 3 » Bicolored Matchings in Some Classes of Graphs |
DLOG
2004
13 years 6 months ago
2004
Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes ...
COMBINATORICS
2006
13 years 5 months ago
2006
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...
DAM
2002
13 years 5 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
STOC
2010
ACM
13 years 10 months ago
2010
ACM
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
GG
2008
Springer
13 years 6 months ago
2008
Springer
The model-driven development of model transformations requires both a technique to model model transformations as well as a means to transform transformation models. Therefore, t...