I/O-complexity of graph algorithms

  • Authors:
  • Kameshwar Munagala;Abhiram Ranade

  • Affiliations:
  • Department of Computer Science, Stanford University, Stanford, CA and Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Mumbai 400076 India;Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Mumbai 400076 India

  • Venue:
  • Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract