8 citations · 8 across the 1 of their papers we have counts for
1 paper
Marc Hellmuth, Manuel Noll, Lydia Ostermeier
It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time.…