4171 search results - page 93 / 835 » Choice numbers of graphs |
168
click to vote
ESE
2006
15 years 6 months ago
2006
This paper presents results from a comparative evaluation of five combination strategies. Combination strategies are test case selection methods that combine "interesting&quo...
176
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
167
click to vote
ACSC
2005
IEEE
16 years 13 hour ago
2005
IEEE
The global dynamics of automata networks (such as neural networks) are a function of their topology and the choice of automata used. Evolutionary methods can be applied to the opt...
196
click to vote
GG
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
145
click to vote
CPC
1998
15 years 6 months ago
1998
We give a characterization for isoperimetric invariants, including the Cheeger constant and the isoperimetric number of a graph. This leads to an isoperimetric inequality for the ...