On the number of minimum size separating vertex sets in a graph and how to find all of them

  • Authors:
  • Arkady Kanevsky

  • Affiliations:
  • Department of Computer Science, Texas A&M University, College Station, TX

  • Venue:
  • SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract