36781 search results - page 132 / 7357 » Parameterizing by the Number of Numbers |
ARSCOM
2002
13 years 10 months ago
2002
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
SIAMDM
2000
13 years 10 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
DM
1998
13 years 10 months ago
1998
A basis of the cycle space C(G) of a graph G is h-fold if each edge of G occurs in at most h cycles of the basis. The basis number b(G) of G is the least integer h such that C(G) ...
DM
1998
13 years 10 months ago
1998
We introduce three deÿnitions of q-analogs of Motzkin numbers and illustrate some combinatorial interpretations of these q-numbers. We relate the ÿrst class of q-numbers to the ...
MOC
1998
13 years 10 months ago
1998
A detailed exposition of Kneser’s neighbour method for quadratic lattices over totally real number fields, and of the sub-procedures needed for its implementation, is given. Usi...