11211 search results - page 48 / 2243 » Data Structures |
STACS
2010
Springer
15 years 3 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
ICCL
1992
IEEE
15 years 1 months ago
1992
IEEE
Multiparadigm programming is a term used to describe a style of software development that makes use of facilities originally designed in support of a number of di erent programmin...
DSL
1997
14 years 11 months ago
1997
DiSTiL is a software generator that implements a declarative domain-specific language (DSL) for container data structures. DiSTiL is a representative of a new approach to domain-...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
JFP
2006
14 years 9 months ago
2006
We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized constant time, and concatenation and splitting in tim...