Hellmuth, MarcMarcHellmuthImrich, WilfriedWilfriedImrichKlöckl, WernerWernerKlöcklStadler, Peter F.Peter F.Stadler2022-03-042022-03-042009https://publica.fraunhofer.de/handle/publica/21850910.1016/j.ejc.2008.09.0062-s2.0-63149129734The problem of recognizing approximate graph products arises in theoretical biology. This paper presents an algorithm that recognizes a large class of approximate graph products. The main part of this contribution is concerned with a new, local prime factorization algorithm that factorizes all strong products on an extensive class of graphs that contains, in particular, all products of triangle-free graphs on at least three vertices. The local approach is linear for graph with fixed maximal degree.en610510journal article