720 search results - page 5 / 144 » Nonrepetitive colorings of graphs |
ICDAR
2009
IEEE
13 years 5 months ago
2009
IEEE
In order to reduce the rejection rate of our automatic reading system, we propose to pre-classify the business documents by introducing an Automatic Recognition of Documents stage...
NOMS
2010
IEEE
13 years 5 months ago
2010
IEEE
The trend for future mobile networks is to move away from Network Elements (NEs) delivered with specially tailored configurations towards off-the-shelf products. The configurations...
DMTCS
2010
13 years 4 months ago
2010
IJKDB
2010
13 years 4 months ago
2010
Searching for repeated features characterizing biological data is fundamental in computational biology. When biological networks are under analysis, the presence of repeated modul...
DAM
2007
13 years 7 months ago
2007
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...