Sciweavers

DM
2007

Recognizing Cartesian products in linear time

13 years 11 months ago
Recognizing Cartesian products in linear time
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammeer, Hagauer, and Imrich [2], who compute the prime factors in O(m log n) time, where m denotes the number of vertices of G and n the number of edges. Our algorithm is conceptually simpler. It gains its efficiency by the
Wilfried Imrich, Iztok Peterin
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where DM
Authors Wilfried Imrich, Iztok Peterin
Comments (0)