Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
This note shows that directed graphs have unique prime factorizations under Cartesian multiplication, and the prime factorizations of weakly connected digraphs can be found in polynomial time.
scientific article; zbMATH DE number 4037887