3211 search results - page 156 / 643 » On the Grundy Number of a Graph |
164
click to vote
COMBINATORICA
2010
15 years 3 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...
165
click to vote
SODA
1990
ACM
15 years 7 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
157
click to vote
DM
2010
15 years 6 months ago
2010
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and
147
click to vote
IWSOC
2003
IEEE
15 years 11 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...
207
click to vote
ACPC
1999
Springer
15 years 10 months 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...