Skip to main content
Journal Article

Range searching over tree cross products

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1879 120-131
DOI: 10.1007/3-540-45253-2_12
28Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce the tree cross-product problem, which abstracts a data structure common to applications in graph visualization, string matching, and software analysis. We design solutions with a variety of tradeoffs, yielding improvements and new results for these applications.

Cite

CITATION STYLE

APA

Buchsbaum, A. L., Goodrich, M. T., & Westbrook, J. R. (2000). Range searching over tree cross products. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1879, 120–131. https://doi.org/10.1007/3-540-45253-2_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free