Fast recognition of direct and strong products
Richard H. Hammack, Wilfried Imrich · Ars Mathematica Contemporanea · 2014
This note describes fast algorithms for computing the prime factors of connected, nonbipartite graphs with respect to the direct product, and of connected graphs with respect to the strong product. The complexities are O ( m min( n 2 ; Δ 3 )) for the direct product, and O ( m a ( G ) Δ) for the strong, where n is the order of the graph G to be factored, m its size, a ( G ) its arboricity, and Δ its maximum degree. That is, the complexities are linear in m for fixed Δ.