Sciweavers

3757 search results - page 165 / 752
» The overlap number of a graph
Sort
View
GEO
2000
15 years 7 months ago
Satisfying Interaction Constraints
: In feature modelling, constraints can be used to store design intent in a model. Interaction constraints are an important type of constraints, which limit the extent to which fea...
Alex Noort, Rafael Bidarra, Willem F. Bronsvoort
DISOPT
2007
114views more  DISOPT 2007»
15 years 6 months ago
Bounds for online bounded space hypercube packing
In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed withi...
Leah Epstein, Rob van Stee
PRL
1998
108views more  PRL 1998»
15 years 6 months ago
Determining local natural scales of curves
An alternative to representing curves at a single scale or a fixed number of multiple scales is to represent them only at their natural (i.e. most significant) scales. This allo...
Paul L. Rosin
CPC
2007
95views more  CPC 2007»
15 years 6 months ago
Colouring Random Regular Graphs
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
Lingsheng Shi, Nicholas C. Wormald
COMBINATORICS
2004
112views more  COMBINATORICS 2004»
15 years 6 months ago
Airy Phenomena and Analytic Combinatorics of Connected Graphs
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
Philippe Flajolet, Bruno Salvy, Gilles Schaeffer