Searching for "Directed Hypergraphs Problems" – sorted by Relevance.
-
On the power of logic resynthesis
- -matrix minimization problem is actually the “mincut linear arrangement of a general directed hypergraph” problem
- Cited by 1 (0 self) – Add To MetaCart
-
De Bruijn and Kautz Bus Networks
- hypergraphs do not exist if ds ? 1 or D ? 1. The (d; D; s)-directed hypergraph problem consists of finding (d
- Cited by 3 (0 self) – Add To MetaCart

