Sciweavers

1363 search results - page 51 / 273
» The road coloring problem
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Image filtering: Potential efficiency and current problems
The paper contains comparisons of lower bound (potential) and achieved efficiency for filtering grayscale and color images corrupted by AWGN. It is demonstrated that for complex s...
Vladimir V. Lukin, Sergey K. Abramov, Nikolay N. P...
CHI
2007
ACM
15 years 10 months ago
EMI: a system to improve and promote the use of public transportation
This paper presents a project to improve the public transportation in the city of Huajuapan de Le?n, Oaxaca, M?xico. Interactive Multimedia Stations (EMI, for its Spanish acronym)...
Tonatzin Yutzin Baños, Emmanuel Aquino, Fer...
OL
2010
140views more  OL 2010»
14 years 4 months ago
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
Balabhaskar Balasundaram, Shyam Sundar Chandramoul...
SPAA
2009
ACM
15 years 4 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
DM
2010
131views more  DM 2010»
14 years 9 months ago
Planar graphs without adjacent cycles of length at most seven are 3-colorable
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...
Oleg V. Borodin, Mickaël Montassier, Andr&eac...