Cartesian graph factorization at logarithmic cost per edge
Rent the article at a discountRent 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.
- 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.
- 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.
- 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.
- 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.
- R. Sedgewick Algorithms, Addison-Wesley, Reading MA, 1983.
- V. G. Vizing,The Cartesian product of graphs., Engl. transl.: Comp. El. Syst. 2 1966, 352–365.
- P. M. Winkler,Factoring a graph, in polynomial time, Europ. J. Combin. 8 1987, 209–212.
- Cartesian graph factorization at logarithmic cost per edge
Volume 2, Issue 4 , pp 331-349
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Cartesian product graphs
- Industry Sectors