105 search results - page 1 / 21 » An experimental study of a simple, distributed edge coloring... |
SPAA
2000
ACM
13 years 9 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
MVA
2002
13 years 4 months ago
2002
This paper describes a robust tracking algorithm for real-time, video based motion capture systems. Conventional motion capture systems are unable to capture motion data in real t...
DAM
2010
13 years 4 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
CORR
2010
Springer
12 years 11 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
CCCG
2010
13 years 6 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...