1. Recognizing Cartesian products in linear time
- Author
-
Imrich, Wilfried and Peterin, Iztok
- Subjects
- *
COMPUTATIONAL mathematics , *COMPUTATIONAL complexity , *GRAPH theory , *ALGORITHMS - Abstract
Abstract: 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 Aurenhammer et al. [Cartesian graph factorization at logarithmic cost per edge, Comput. Complexity 2 (1992) 331–349], who compute the prime factors in 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 introduction of edge-labellings. [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF