Sciweavers

302 search results - page 7 / 61
» Efficient Algorithms for the Longest Path Problem
Sort
View
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
14 years 17 days ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
ESA
2008
Springer
136views Algorithms» more  ESA 2008»
13 years 10 months ago
Detecting Regular Visit Patterns
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...
Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, T...
ITC
1993
IEEE
148views Hardware» more  ITC 1993»
14 years 20 days ago
DELTEST: Deterministic Test Generation for Gate-Delay Faults
This paper presents an efficient approach to generate tests for gate delay faults. Unlike other known algorithms which try to generate a 'good' delay test the presented ...
Udo Mahlstedt
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
14 years 1 months ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev
CSB
2003
IEEE
108views Bioinformatics» more  CSB 2003»
14 years 1 months ago
A Pattern Matching Algorithm for Codon Optimization and CpG Motif-Engineering in DNA Expression Vectors
Codon optimization enhances the efficiency of DNA expression vectors used in DNA vaccination and gene therapy by increasing protein expression. Additionally, certain nucleotide mo...
Ravi Vijaya Satya, Amar Mukherjee, Udaykumar Ranga