Sciweavers

3208 search results - page 544 / 642
» A Lower Bound for Primality
Sort
View
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 10 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...
SIAMDM
2008
97views more  SIAMDM 2008»
13 years 10 months ago
Large Nearly Regular Induced Subgraphs
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
Noga Alon, Michael Krivelevich, Benny Sudakov
SIAMDM
2008
97views more  SIAMDM 2008»
13 years 10 months ago
Disjoint Color-Avoiding Triangles
A set of pairwise edge-disjoint triangles of an edge-colored Kn is r-color avoiding if it does not contain r monochromatic triangles, each having a different color. Let fr(n) be th...
Raphael Yuster
SIAMDM
2008
105views more  SIAMDM 2008»
13 years 10 months ago
Average Spectra and Minimum Distances of Low-Density Parity-Check Codes over Abelian Groups
Ensembles of regular low-density parity-check codes over any finite Abelian group G are studied. The nonzero entries of the parity matrix are randomly chosen, independently and uni...
Giacomo Como, Fabio Fagnani
SIAMJO
2008
108views more  SIAMJO 2008»
13 years 10 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel