Searching for authors named "Louis Theran" – sorted by Relevance.
-
L.: “Sparse hypergraphs and pebble game algorithms
- Streinu and Louis Theran Abstract A hypergraph G = (V, E) is (k, ℓ)-sparse if no subset V ′ ⊂ V spans more
- Cited by 3 (2 self) – Add To MetaCart

