computational complexity

, Volume 2, Issue 4, pp 331–349

Cartesian graph factorization at logarithmic cost per edge

  • F. Aurenhammer
  • J. Hagauer
  • W. Imrich
Article

DOI: 10.1007/BF01200428

Cite this article as:
Aurenhammer, F., Hagauer, J. & Imrich, W. Comput Complexity (1992) 2: 331. doi:10.1007/BF01200428

Abstract

LetG be a connected graph withn vertices andm edges. We develop an algorithm that finds the (unique) prime factors ofG with respect to the Cartesian product inO(m logn) time andO(m) space. This shows that factoringG is at most as costly as sorting its edges. The algorithm gains its efficiency and practicality from using only basic properties of product graphs and simple data structures.

Key words

Cartesian product graphsFactorizationAlgorithms

Subject classifications

68Q05C

Copyright information

© Birkhäuser Verlag 1992

Authors and Affiliations

  • F. Aurenhammer
    • 1
  • J. Hagauer
    • 1
  • W. Imrich
    • 2
  1. 1.Institute for Theoretical Computer ScienceTechnische Universitaet GrazGrazAustria
  2. 2.Dept. of Mathematics and Applied GeometryMontanuniversitaet LeobenLeobenAustria