Sciweavers

44 search results - page 9 / 9
» (p, 1)-Total labelling of graphs
Sort
View
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
13 years 6 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
IS
2010
13 years 3 months ago
Tree pattern mining with tree automata constraints
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 5 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
JCB
2008
52views more  JCB 2008»
13 years 5 months ago
Spectrum-Based De Novo Repeat Detection in Genomic Sequences
A novel approach to the detection of genomic repeats is presented in this paper. The technique, dubbed SAGRI (Spectrum Assisted Genomic Repeat Identifier), is based on the spectru...
Huy Hoang Do, Kwok Pui Choi, Franco P. Preparata, ...