Sciweavers

44651 search results - page 77 / 8931
» Generalized
Sort
View
JCT
2007
71views more  JCT 2007»
13 years 10 months ago
Divisibility of generalized Catalan numbers
We define a q generalization of weighted Catalan numbers studied by Postnikov and Sagan, and prove a result on the divisibility by p of such numbers when p is a prime and q its p...
Matjaz Konvalinka
CG
2005
Springer
13 years 9 months ago
A new algorithm for Boolean operations on general polygons
A new algorithm for Boolean operations on general planar polygons is presented. It is available for general planar polygons (manifold or non-manifold, with or without holes). Edge...
Yu Peng, Jun-Hai Yong, Wei-Ming Dong, Hui Zhang, J...
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 9 months ago
Tight Approximation Results for General Covering Integer Programs
In this paper we study approximation algorithms for solving a general covering integer program. An
Stavros G. Kolliopoulos, Neal E. Young
DM
2002
95views more  DM 2002»
13 years 9 months ago
On the superconnectivity of generalized p-cycles
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
Camino Balbuena, Ignacio M. Pelayo, J. Góme...
MOC
2002
109views more  MOC 2002»
13 years 9 months ago
Distribution of generalized Fermat prime numbers
Numbers of the form Fb,n = b2n +1 are called Generalized Fermat Numbers (GFN). A computational method for testing the probable primality of
Harvey Dubner, Yves Gallot