A local prime factor decomposition algorithm

Discrete Mathematics

Volumn 311, Issue 12, 2011, Pages 944-965

  Hellmuth, Marc ^a,b  

^a MAX PLANCK INSTITUTE FOR MATHEMATICS IN THE SCIENCES   (Germany)

^b UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

Backbone; Color continuation; Local covering; Prime factor decomposition; S prime; S1 condition; Strong product graph

Indexed keywords

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

References (37)

1. D. Archambault, T. Munzner, and D. Auber TopoLayout: Multilevel graph layout by topological features IEEE Trans. Vis. Comput. Graphics 13 2 2007 305 317
2. B. Brear On subgraphs of Cartesian product graphs and S-primeness Discrete Math. 282 2004 43 52
3. W. Drfler, and W. Imrich ber das starke Produkt von endlichen Graphen sterreih. Akad. Wiss., Mathem.-Natur. Kl., S.-B.II 178 1969 247 262
4. J. Feigenbaum, Product graphs: some algorithmic and combinatorial results. Technical Report STAN-CS-86-1121, Stanford University, Computer Science, Ph.D. Thesis, 1986.
5. J. Feigenbaum, and R.A. Haddad On factorable extensions and subgraphs of prime graphs SIAM J. Discrete Math. 2 1989 197 218
6. J. Feigenbaum, and A.A. Schffer Finding the prime factors of strong direct product graphs in polynomial time Discrete Math. 109 1992 77 102
7. J. Hagauer, and J. erovnik An algorithm for the weak reconstruction of cartesian-product graphs J. Combin. Inf. Syst. Sci. 24 1999 97 103
8. R. Hammack On direct product cancellation of graphs Discrete Math. 309 8 2009 2538 2543
9. R. Hammack, and W. Imrich On Cartesian skeletons of graphs Ars Math. Contemp. 2 2 2009 191 205
10. R. Hammack, W. Imrich, and S Klavar Handbook of Product Graphs 2nd ed. Discrete Math. Appl. 2011 CRC Press
11. M. Hellmuth, Local prime factor decomposition of approximate strong product graphs. Ph.D. thesis, University Leipzig, Department of Mathematics and Computer Science, 2010.
12. M. Hellmuth, L. Gringmann, P.F. Stadler, Diagonalized Cartesian products of S-prime graphs are S-prime. Discrete Math. (2009) (submitted for publication).
13. M. Hellmuth, W. Imrich, W. Klckl, and P.F. Stadler Approximate graph products European J. Combin. 30 2009 1119 1133
14. M. Hellmuth, W. Imrich, W. Klckl, and P.F. Stadler Local algorithms for the prime factorization of strong product graphs Math. Comput. Sci 2 4 2009 653 682
15. M. Hellmuth, D. Merkle, and M. Middendorf Extended shapes for the combinatorial design of RNA sequences Int. J. Comput. Biol. Drug Design 2 4 2009 371 384
16. W. Imrich, and S Klavar Product Graphs Wiley-Intersci. Ser. Discrete Math. Optim. 2000 Wiley-Interscience New York
17. W. Imrich, S. Klavar, and D.F. Rall Topics in Graph Theory: Graphs and Their Cartesian Product 2008 AK Peters, Ltd. Wellesley, MA
18. W. Imrich, T. Pisanski, and J. erovnik Recognizing cartesian graph bundles Discrete Math. 167168 1997 393 403 (Pubitemid 127367573)
19. W. Imrich, and J. erovnik Factoring Cartesian-product graphs J. Graph Theory 18 6 1994
20. Wilfried Imrich, and Janez erovnik On the weak reconstruction of cartesian-product graphs Discrete Math. 150 13 1996
21. Wilfried Imrich, Blaz Zmazek, and Janez erovnik Weak k-reconstruction of cartesian product graphs Comb01, Euroconference on Combinatorics, Graph Theory and Applications Electronic Notes in Discrete Mathematics vol. 10 2001 297 300 (Pubitemid 33814073)
22. Stefan Jnicke, Christian Heine, Marc Hellmuth, Peter F. Stadler, and Gerik Scheuermann Visualization of graph products IEEE Trans. Vis. Comput. Graphics 16 6 2010 1082 1089
23. A. Kaveh, and K. Koohestani Graph products for configuration processing of space structures Comput. Struct. 86 1112 2008 1219 1231
24. A. Kaveh, and H. Rahami An efficient method for decomposition of regular structures using graph products Intern. J. Numer. Meth. Eng. 61 11 2004 1797 1808 (Pubitemid 39558467)
25. S. Klavar, A. Lipovec, and M. Petkovek On subgraphs of Cartesian product graphs Discrete Math. 244 2002 223 230
26. R.H. Lamprey, and B.H. Barnes A new concept of primeness in graphs Networks 11 1981 279 284
27. R.H. Lamprey, and B.H. Barnes A characterization of Cartesian-quasiprime graphs Congr. Numer. 109 1995 117 121
28. R. McKenzie Cardinal multiplication of structures with a reflexive relation Fund. Math. LXX 1971 59 101
29. P.J. Ostermeier, M. Hellmuth, K. Klemm, J. Leydold, and P.F. Stadler A note on quasi-robust cycle bases Ars Math. Contemp. 2 2 2009 231 240
30. G. Sabidussi Graph multiplication Mathematische Zeitschrift 72 1959 446 457
31. G. Sabidussi Subdirect representations of graphs in infinite and finite sets Colloq. Math. Soc. Janos Bolyai 10 1975 1199 1226
32. C. Tardif A fixed box theorem for the Cartesian product of graphs and metric spaces Discrete Math. 171 13 1997 237 248 (Pubitemid 127379688)
33. V.G. Vizing The Cartesian product of graphs Vycisl. Sistemy 9 1963 30 43
34. J. erovnik On recognition of strong graph bundles Math. Slovaca 50 2000 289 301
35. G. Wagner, and P.F. Stadler Quasi-independence, homology and the unity of type: a topological theory of characters J. Theoret. Biol. 220 2003 505 527 (Pubitemid 36293161)
36. B. Zmazek, and J. erovnik Algorithm for recognizing cartesian graph bundles Discrete Appl. Math. 120 2002 275 302
37. B. Zmazek, and J. erovnik Weak reconstruction of strong product graphs Discrete Math. 307 2007 641 649 (Pubitemid 44960269)