Determine Interior Vertices of Graph Intervals
Victor Jon Griswold · Open Scholarship Institutional Repository (Washington University in St. Louis) · 1990
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.