Pages that link to "Item:Q517789"
From MaRDI portal
The following pages link to On the complexity of strongly connected components in directed hypergraphs (Q517789):
Displaying 11 items.
- Ergodicity conditions for zero-sum games (Q255787) (← links)
- On computing the 2-vertex-connected components of directed graphs (Q266828) (← links)
- Strongly connected multivariate digraphs (Q521369) (← links)
- Computing the vertices of tropical polyhedra using directed hypergraphs (Q1943657) (← links)
- Extreme rays of the \(\ell^\infty\)-nearest ultrametric tropical polytope (Q2174403) (← links)
- A game theory approach to the existence and uniqueness of nonlinear Perron-Frobenius eigenvectors (Q2281568) (← links)
- Directed hypergraphs and Horn minimization (Q2404615) (← links)
- Whitney's connectivity inequalities for directed hypergraphs (Q5045242) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465880) (← links)
- Fuzzy logic programs as hypergraphs. Termination results (Q6079415) (← links)
- \((k-2)\)-linear connected components in hypergraphs of rank \(k\) (Q6599814) (← links)