36781 search results - page 338 / 7357 » Parameterizing by the Number of Numbers |
187
Voted
DM
2006
15 years 7 months ago
2006
Let n(G) denote the number of vertices of a graph G and let (G) be the independence number of G, the maximum number of pairwise nonadjacent vertices of G. The Hall ratio of a grap...
187
click to vote
ICCS
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. We analyze and simulate a near continuum MagnetoGasDynamic(MGD) flow inside a two-dimensional microchannel with a low magnetic Reynolds number assumption. Complex physics...
268
click to vote
TYPES
2007
Springer
16 years 1 months ago
2007
Springer
We consider propositional formulas built on implication. The size of a formula is the number of occurrences of variables in it. We assume that two formulas which differ only in th...
171
Voted
COCOON
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
184
click to vote
WG
2004
Springer
16 years 25 days ago
2004
Springer
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...