Operations on sparse relations and efficient algorithms for grammar problems

  • Authors:

  • Harry B. Hunt;Thomas G. Szymanski;Jeffrey D. Ullman

  • Affiliations:

  • -;-;-

  • Venue:
  • SWAT '74 Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)
  • Year:
  • 1974

Quantified Score

Hi-index 0.00

Visualization

Abstract

various operations on graphs, matrices, or relations can be executed more quickly when the arguments are "sparse" (i.e., if e