Pages that link to "Item:Q906379"
From MaRDI portal
The following pages link to Fast factorization of Cartesian products of (directed) hypergraphs (Q906379):
Displaying 9 items.
- Associativity and non-associativity of some hypergraph products (Q340610) (← links)
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411) (← links)
- Factorization of products of hypergraphs: Structure and algorithms (Q1939276) (← links)
- Strong products of hypergraphs: unique prime factorization theorems and algorithms (Q2449107) (← links)
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time (Q2515582) (← links)
- Factoring directed graphs with respect to the cardinal product in polynomial time II (Q2997605) (← links)
- Factoring directed graphs with respect to the cardinal product in polynomial time (Q3504810) (← links)
- The cut method on hypergraphs for the Wiener index (Q6173950) (← links)
- Kronecker product of tensors and hypergraphs: structure and dynamics (Q6623659) (← links)