Sciweavers

10608 search results - page 111 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
TCS
2010
13 years 8 months ago
Computing the graph-based parallel complexity of gene assembly
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
Artiom Alhazov, Chang Li, Ion Petre
CIAC
2010
Springer
281views Algorithms» more  CIAC 2010»
13 years 6 months ago
Parameterized Complexity of Even/Odd Subgraph Problems
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
Leizhen Cai, Boting Yang
CP
2003
Springer
14 years 3 months ago
Improved Algorithms for Max-restricted Path Consistency
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
Fabrizio Grandoni, Giuseppe F. Italiano
ICDE
2006
IEEE
110views Database» more  ICDE 2006»
14 years 11 months ago
Detecting Duplicates in Complex XML Data
Recent work both in the relational and the XML world have shown that the efficacy and efficiency of duplicate detection is enhanced by regarding relationships between entities. Ho...
Melanie Weis, Felix Naumann
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 10 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh