An O(n2) time algorithm for the 2-chain cover problem and related problems

  • Authors:
  • Tze-heng Ma;Jeremy Spinrad

  • Affiliations:
  • Institute of Information Science, Academia Sinica, Nankang, Taipei, Taiwan, Republic of China 11529;Dept. of Computer Science, Vanderbilt U., Nashville, TN

  • Venue:
  • SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract