A counterexample to the algorithms for determining opaque minimal forests

  • Authors:

  • Thomas Shermer

  • Affiliations:

  • -

  • Venue:
  • Information Processing Letters
  • Year:
  • 1991

  • Opaque sets

    APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques

  • Computational geometry column 58

    ACM SIGACT News

Quantified Score

Hi-index 0.89

Visualization

Abstract