External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph

Pierre Kelsen. On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph. In Proceedings of the Twenty Fourth Annual ACM Symposium on Theory of Computing, 4-6 May 1992, Victoria, British Columbia, Canada. pages 339-350, ACM, 1992.

Abstract

Abstract is missing.

runs on