Sciweavers

CPC
2004
82views more  CPC 2004»
13 years 11 months ago
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Philippe Duchon, Philippe Flajolet, Guy Louchard, ...
CPC
2004
66views more  CPC 2004»
13 years 11 months ago
Two Results on Real Zeros of Chromatic Polynomials
This note presents two results on real zeros of chromatic polynomials. The first result states that if G is a graph containing a q-tree as a spanning subgraph, then the chromatic ...
Feng Ming Dong, Khee Meng Koh
CPC
2004
59views more  CPC 2004»
13 years 11 months ago
Max Cut for Random Graphs with a Planted Partition
Béla Bollobás, Alex D. Scott
CPC
2004
49views more  CPC 2004»
13 years 11 months ago
Dynamical Analysis of the Parametrized Lehmer-Euclid Algorithm
Benoit Daireaux, Brigitte Vallée
CPC
2004
65views more  CPC 2004»
13 years 11 months ago
On the b-Independence Number of Sparse Random Graphs
Geoffrey Atkinson, Alan M. Frieze
CPC
2004
87views more  CPC 2004»
13 years 11 months ago
Quicksort with Unreliable Comparisons: A Probabilistic Analysis
We provide a probabilistic analysis of the output of Quicksort when comparisons can err.
Laurent Alonso, Philippe Chassaing, Florent Gillet...
CPC
2004
69views more  CPC 2004»
13 years 11 months ago
New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
Let C be a code of length n over an alphabet of q letters. A codeword y is called a descendant of a set of t codewords {x1 , . . . , xt } if yi {x1 i , . . . , xt i} for all i = ...
Noga Alon, Uri Stav
CPC
2004
98views more  CPC 2004»
13 years 11 months ago
And/Or Trees Revisited
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
Brigitte Chauvin, Philippe Flajolet, Danièl...