3204 search results - page 93 / 641 » The Alcuin Number of a Graph |
COMBINATORICA
2010
13 years 5 months ago
2010
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
IWSOC
2003
IEEE
14 years 1 months ago
2003
IEEE
The availability of high-level design entry tooling is crucial for the viability of any reconfigurable SoC architecture. This paper presents a template generation method to extra...
ACPC
1999
Springer
14 years 12 days ago
1999
Springer
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
VL
2010
IEEE
13 years 6 months ago
2010
IEEE
— Euler diagrams are frequently used for visualizing information about collections of objects and form an important component of various visual languages. Properties possessed by...