Pages that link to "Item:Q1098860"
From MaRDI portal
The following pages link to Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time (Q1098860):
Displaying 11 items.
- On the Cartesian skeleton and the factorization of the strong product of digraphs (Q482282) (← links)
- Finding the prime factors of strong direct product graphs in polynomial time (Q686286) (← links)
- Fast factorization of Cartesian products of (directed) hypergraphs (Q906379) (← links)
- Strict refinement for graphs and digraphs (Q1072575) (← links)
- Cartesian graph factorization at logarithmic cost per edge (Q1210332) (← links)
- Cartesian products of directed graphs with loops (Q1709534) (← links)
- Boundary vertices of Cartesian product of directed graphs (Q1738686) (← links)
- Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs (Q2254071) (← links)
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time (Q2515582) (← links)
- Digraphs Products (Q3120442) (← links)
- Direct product of automorphism groups of digraphs (Q5217061) (← links)
