1736 search results - page 268 / 348 » The rank-width of Directed Graphs |
141
click to vote
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
137
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
156
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
159
click to vote
KR
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
158
click to vote
CPM
1993
Springer
15 years 8 months ago
1993
Springer
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re
ect the correct biolog...