3211 search results - page 190 / 643 » On the Grundy Number of a Graph |
140
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
167
click to vote
DAM
2008
15 years 6 months ago
2008
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
127
click to vote
DM
1999
15 years 6 months ago
1999
We introduce some equivalence relations on graphs and posets and prove that they are closed under the cartesian product operation. These relations concern the edge-isoperimetric p...
192
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
165
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...