, Volume 2, Issue 4, pp 331-349

Cartesian graph factorization at logarithmic cost per edge

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.