[HTML][HTML] Recognizing Cartesian products in linear time
W Imrich, I Peterin - Discrete mathematics, 2007 - Elsevier
W Imrich, I Peterin
Discrete mathematics, 2007•ElsevierWe 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 O (mlogn) 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.
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 O (mlogn) 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.
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 O(mlogn) 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.
Elsevier
Showing the best result for this search. See all results