The F&B-index is used to speed up pattern matching in tree and graph data, and is based on the maximum F&B-bisimulation, which can be computed in loglinear time for graphs. It has been shown that the maximum F-bisimulation can be computed in linear time for DAGs. We build on this result, and introduce a linear algorithm for computing the maximum F&B-bisimulation for tree data. It first computes the maximum F-bisimulation, and then refines this to a maximal B-bisimulation. We prove that the result equals the maximum F&B-bisimulation. © 2010 Springer-Verlag.
CITATION STYLE
Grimsmo, N., Bjørklund, T. A., & Hetland, M. L. (2010). Linear computation of the maximum simultaneous forward and backward bisimulation for node-labeled trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6309 LNCS, pp. 18–32). https://doi.org/10.1007/978-3-642-15684-7_3
Mendeley helps you to discover research relevant for your work.