2294 search results - page 21 / 459 » From Path Graphs to Directed Path Graphs |
SWAT
1998
Springer
15 years 1 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
ISAAC
2009
Springer
15 years 2 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
BMCBI
2006
14 years 9 months ago
2006
Background: The goal of information integration in systems biology is to combine information from a number of databases and data sets, which are obtained from both high and low th...
IPL
2007
14 years 9 months ago
2007
Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...