A lower bound to the complexity of Euclidean and rectilinear matching algorithms

  • Authors:

  • M. D. Grigoriadis;B. Kalantari

  • Affiliations:

  • Rutgers Univ., New Brunswick, NJ;Rutgers Univ., New Brunswick, NJ

  • Venue:
  • Information Processing Letters
  • Year:
  • 1986

Quantified Score

Hi-index 0.89

Visualization

Abstract