Pages that link to "Item:Q2940100"
From MaRDI portal
The following pages link to Fast recognition of direct and strong products (Q2940100):
Displaying 11 items.
- On the Cartesian skeleton and the factorization of the strong product of digraphs (Q482282) (← links)
- A local prime factor decomposition algorithm (Q536219) (← links)
- Local algorithms for the prime factorization of strong product graphs (Q626891) (← links)
- Finding the prime factors of strong direct product graphs in polynomial time (Q686286) (← links)
- Recognizing Cartesian products in linear time (Q864136) (← links)
- Cartesian graph factorization at logarithmic cost per edge (Q1210332) (← links)
- Direct product primality testing of graphs is GI-hard (Q1998840) (← links)
- Fast recognition of partial star products and quasi cartesian products (Q3465660) (← links)
- On Cartesian skeletons of graphs (Q3552332) (← links)
- Product graph representations (Q4020705) (← links)
- A Heuristic for Direct Product Graph Decomposition (Q6075715) (← links)