Document Type
Technical Report
Publication Date
1990-12-05
Technical Report Number
WUCS-90-40
Abstract
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. Four approaches to this problem are presented, each exploiting more knowledge about this work's application domain and hence becoming progressively less memory intensive. The two most promising of these approaches are examined in depth.
Recommended Citation
Griswold, Victor Jon, "Determining Interior Vertices of Graph Intervals" Report Number: WUCS-90-40 (1990). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/713
COinS
Comments
Revision of WUCS-90-09