On finding minimal 2-connected subgraphs

  • Authors:
  • Pierre Kelsen;Vijaya Ramachandran

  • Affiliations:
  • Department of Computer Sciences, University of Texas, Austin, TX;Department of Computer Sciences, University of Texas, Austin, TX

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

Quantified Score

Hi-index 0.00

Visualization

Abstract