Technical Report Number
The problem of determining which events occur "between" two bounding events A and B in partially-ordered logical time is equivalent to being able to list, for a directed acyclic graph, the vertices on all paths with origin a and terminus b. We present four approaches to this problem, each progressively less memory-intensive. The two most promising of these approaches are examined in depth.
Griswold, Victor Jon, "Determine Interior Vertices of Graph Intervals" Report Number: WUCS-90-09 (1990). All Computer Science and Engineering Research.
Permanent URL: http://dx.doi.org/10.7936/K7KP80H5