On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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.

This author has not been identified. Look up 'Pierre Kelsen' in Google

runs on WebDSL