4095 search results - page 144 / 819 » How to test a tree |
SAS
2000
Springer
14 years 2 months ago
2000
Springer
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...
CCCG
2008
13 years 12 months ago
2008
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...
IPL
2010
13 years 8 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
IPCV
2008
13 years 12 months ago
2008
We propose one geometric algorithm to solve both the problem of circularity test and the problem of circularity measure. The former problem consists in deciding whether a given di...
JANCL
2006
13 years 10 months ago
2006
We describe KAT-ML, an implementation of an interactive theorem prover for Kleene algebra with tests (KAT). The system is designed to reflect the natural style of reasoning with K...