Sciweavers

2181 search results - page 29 / 437
» The restriction scaffold problem
Sort
View
DAM
2008
72views more  DAM 2008»
13 years 8 months ago
Diameter-sufficient conditions for a graph to be super-restricted connected
A vertex-cut X is said to be a restricted cut of a graph G if it is a vertex-cut such that no vertex u in G has all its neighbors in X. Clearly, each connected component of G - X ...
Camino Balbuena, Yuqing Lin, Mirka Miller
IWPEC
2004
Springer
14 years 2 months ago
Online Problems, Pathwidth, and Persistence
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
Rodney G. Downey, Catherine McCartin
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 8 months ago
Complexity of some Path Problems in DAGs and Linear Orders
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
Serge Burckel
IPL
2008
87views more  IPL 2008»
13 years 8 months ago
Optimal prefix and suffix queries on texts
Abstract. In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied M
Maxime Crochemore, Costas S. Iliopoulos, Mohammad ...
ESA
2005
Springer
136views Algorithms» more  ESA 2005»
14 years 2 months ago
Approximating the 2-Interval Pattern Problem
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure predict...
Maxime Crochemore, Danny Hermelin, Gad M. Landau, ...