139 search results - page 19 / 28 » The Domatic Number of Regular Graphs |
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
Customization of processor architectures through Instruction Set Extensions (ISEs) is an effective way to meet the growing performance demands of embedded applications. A high-qua...
CCGRID
2010
IEEE
13 years 5 months ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...