Recognizing Cartesian products in linear time

Discrete Mathematics

Volumn 307, Issue 3-5, 2007, Pages 472-483

  Imrich, Wilfried ^a   Peterin, Iztok ^b  

^a UNIVERSITY OF LEOBEN   (Austria)

^b UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

Cartesian product graphs; Decomposition; Linear algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEAR ALGEBRA; NUMERICAL METHODS;

CARTESIAN PRODUCT GRAPHS; EDGE-LABELLINGS; LINEAR ALGORITHM; LINEAR TIME;

GRAPH THEORY;

EID: 33845607309     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.09.038     Document Type: Article

References (10)

1. Aho A.V., Hopcroft J.E., and Ullman J.D. The Design and Analysis of Computer Algorithms (1974), Addison-Wesley, Reading, MA
2. Aurenhammer F., Hagauer J., and Imrich W. Cartesian graph factorization at logarithmic cost per edge. Comput. Complexity 2 (1992) 331-349
3. Feder T. Product graph representations. J. Graph Theory 16 (1992) 467-488
4. Feigenbaum J., Hershberger J., and Schäffer A.A. A polynomial time algorithm for finding the prime factors of Cartesian-product graphs. Discrete Appl. Math. 12 (1985) 123-138
5. W. Imrich, Embedding graphs into Cartesian products, in: Graph Theory and its Applications: East and West (Jinan, 1986), Annals of the New York Academy of Sciences, vol. 576, New York Academy of Sciences, New York, 1989, pp. 266-274.
6. Imrich W., and Klavžar S. Product Graphs: Structure and Recognition (2000), Wiley, New York
7. Sabidussi G. Graph multiplication, Math. Z. 72 (1960) 446-457
8. V.G. Vizing, The Cartesian product of graphs (Russian), Vyčisl. Systemy 9 (1963) 30-43, English translation in Comput. Electron Syst. 2 (1966) 352-365.
9. Vizing V.G. Some unsolved problems in graph theory. Russian Math. Surveys 23 (1968) 125-141
10. Winkler P.M. Factoring a graph in polynomial time. European J. Combin. 8 (1987) 209-212