36781 search results - page 45 / 7357 » Parameterizing by the Number of Numbers |
ICONIP
1998
13 years 11 months ago
1998
This paper describes the implementation of a system that reminds the user of the telephone number of a given list, even if the user only remembers part of it, or if the given numb...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
COMBINATORICS
2006
13 years 10 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
EJC
2006
13 years 10 months ago
2006
1 The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices2 either G contains G1 or G contains G2, where G denotes the complement of G. In this...
JSCIC
2008
13 years 10 months ago
2008
High Mach number astrophysical jets are simulated using a positive scheme, and are compared with WENO-LF simulations. A version of the positive scheme has allowed us to simulate as...