Skip to main content
Log in

Cartesian graph factorization at logarithmic cost per edge

  • Published:
computational complexity Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • F. Aurenhammer, and J. Hagauer,Computing equivalence classes among the edges of a graph with applications, Proc. Int. Conf. Algebraic Graph Theory, 1989; and Discrete Math. Vol. 110, 1992.

  • T. Feder,Product Graph Representations, J. of Graph Theory, 1992 (to appear).

  • J. Feigenbaum,Product Graphs: Some algorithmic and combinatorial properties, Ph. D. Thesis, Dept. Comput Sci., Stanford. Univ., CA, 1986.

    Google Scholar 

  • J. Feigenbaum, J. Hershberger, andA. Schäffer,A polynomial time algorithm for finding the prime factors of Cartesian-product graphs, Discrete Appl. Math. 12 1985, 123–138.

    Google Scholar 

  • A. Gibbons,Algorithmic Graph Theory, Cambridge University Press, 1985.

  • R. L. Graham, andP. M. Winkler,On isometric embeddings of graphs, Trans. AMS 288 1985, 527–536.

    Google Scholar 

  • B. Hochstrasser,A note on Winkler's algorithm for factoring a connected graph, Proc. Int. Conf. Algebraic Graph. Theory, 1989; Discrete Math. Vol. 110, 1992.

  • G. Sabidussi,Graph multiplication, Math Z. 72 1960, 446–457.

    Google Scholar 

  • R. Sedgewick Algorithms, Addison-Wesley, Reading MA, 1983.

    Google Scholar 

  • V. G. Vizing,The Cartesian product of graphs., Engl. transl.: Comp. El. Syst. 2 1966, 352–365.

    Google Scholar 

  • P. M. Winkler,Factoring a graph, in polynomial time, Europ. J. Combin. 8 1987, 209–212.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aurenhammer, F., Hagauer, J. & Imrich, W. Cartesian graph factorization at logarithmic cost per edge. Comput Complexity 2, 331–349 (1992). https://doi.org/10.1007/BF01200428

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01200428

Key words

Subject classifications

Navigation