Searching for "Random hypergraphs and algorithmics" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

The Algorithmic Aspects of Uncrowded Hypergraphs
by Claudia Bertram-kretzberg, Hanno Lefmann — 1997 — Proc. 8th ACM-SIAM Symposium on Discrete Algorithms SODA
… with average degree t k and not too many small cycles. For random hypergraphs, no algorithm has a better…
Cited by 3 (3 self) – Add To MetaCart

The Algorithmic Aspects of Uncrowded Hypergraphs
by Claudia Bertram-Kretzberg And, Claudia Bertram-kretzberg, Hanno Lefmann — 1996 — Proc. 8th ACM-SIAM Symposium on Discrete Algorithms SODA
… and not too many small cycles. For random hypergraphs, no algorithm has a better performance ratio. The idea…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB