Sciweavers

310 search results - page 59 / 62
» dam 2008
Sort
View
DAM
2007
106views more  DAM 2007»
13 years 10 months ago
On the generation of bicliques of a graph
This work describes a study on the generation of bicliques of a graph. We show that it is NP-complete to test whether a subset of the vertices of a graph is part of a biclique. We ...
Vânia M. F. Dias, Celina M. Herrera de Figue...
DAM
1999
100views more  DAM 1999»
13 years 10 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
DAM
1999
114views more  DAM 1999»
13 years 10 months ago
Perfect and Almost Perfect Sequences
The autocorrelation function of a sequence is a measure for how much the given sequence di ers from its translates. Periodic binary sequences with good correlation properties have...
Dieter Jungnickel, Alexander Pott
DAM
2007
131views more  DAM 2007»
13 years 10 months ago
Haplotyping with missing data via perfect path phylogenies
Computational methods for inferring haplotype information from genotype data are used in studying the association between genomic variation and medical condition. Recently, Gusfi...
Jens Gramm, Till Nierhoff, Roded Sharan, Till Tant...
DAM
2007
70views more  DAM 2007»
13 years 10 months ago
Path-kipas Ramsey numbers
For two given graphs F and H, the Ramsey number R(F, H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a ...
A. N. M. Salman, H. J. Broersma