A local prime factor decomposition algorithm

This work is concerned with the prime factor decomposition (PFD) of strong product graphs. A new quasi-linear time algorithm for the PFD with respect to the strong product for arbitrary, finite, connected, undirected graphs is derived. Moreover, since most graphs are prime although they can have a product-like structure, also known as approximate graph products, the practical application of the well-known ''classical'' prime factorization algorithm is strictly limited. This new PFD algorithm is based on a local approach that covers a graph by small factorizable subgraphs and then utilizes this information to derive the global factors. Therefore, we can take advantage of this approach and derive in addition a method for the recognition of approximate graph products.

[1]  Janez Zerovnik,et al.  On recognizing Cartesian graph bundles , 2001, Discret. Math..

[2]  Gerik Scheuermann,et al.  Visualization of Graph Products , 2010, IEEE Transactions on Visualization and Computer Graphics.

[3]  Claude Tardif,et al.  A fixed box theorem for the cartesian product of graphs and metric spaces , 1997, Discret. Math..

[4]  Wilfried Imrich,et al.  Factoring Cartesian-product graphs , 1994 .

[5]  Wilfried Imrich,et al.  Weak k-reconstruction of cartesian product graphs , 2001, Electron. Notes Discret. Math..

[6]  Peter F Stadler,et al.  Quasi-independence, homology and the unity of type: a topological theory of characters. , 2003, Journal of theoretical biology.

[7]  Wilfried Imrich,et al.  On the weak reconstruction of Cartesian-product graphs , 1996, Discret. Math..

[8]  Bostjan Bresar.  On subgraphs of Cartesian product graphs and S-primeness , 2000, Electron. Notes Discret. Math..

[9]  Peter F. Stadler,et al.  A note on quasi-robust cycle bases , 2009, Ars Math. Contemp..

[10]  Gert Sabidussi,et al.  Graph multiplication , 1959 .

[11]  Wilfried Imrich,et al.  Topics in Graph Theory: Graphs and Their Cartesian Product , 2008 .

[12]  Ali Kaveh,et al.  An efficient method for decomposition of regular structures using graph products , 2004 .

[13]  Sandi Klavzar,et al.  On subgraphs of Cartesian product graphs , 2002, Discret. Math..

[14]  Wilfried Imrich,et al.  Local Algorithms for the Prime Factorization of Strong Product Graphs , 2009, Math. Comput. Sci..

[15]  Ralph McKenzie,et al.  Cardinal multiplication of structures with a reflexive relation , 1971 .

[16]  Joan Feigenbaum.  Product graphs: some algorithmic and combinatorial results (graph isomorphism) , 1986 .

[17]  V. G. Vizing.  The cartesian product of graphs , 1963 .

[18]  Tamara Munzner,et al.  TopoLayout: Multilevel Graph Layout by Topological Features , 2007, IEEE Transactions on Visualization and Computer Graphics.

[19]  Janez Zerovnik,et al.  Algorithm for Recognizing Cartesian Graph Bundles , 1999, Electron. Notes Discret. Math..

[20]  Richard Hammack.  On direct product cancellation of graphs , 2009, Discret. Math..

[21]  V. Yegnanarayanan,et al.  On product graphs , 2012 .

[22]  Joan Feigenbaum,et al.  On Factorable Extensions and Subgraphs of Prime Graphs , 1989, SIAM J. Discret. Math..

[23]  Marc Hellmuth.  Local Prime Factor Decompositionof Approximate Strong Product Graphs , 2010 .

[24]  R. H. Lamprey,et al.  A new concept of primeness in graphs , 1981, Networks.

[25]  Joan Feigenbaum,et al.  Finding the prime factors of strong direct product graphs in polynomial time , 1992, Discret. Math..

[26]  Daniel Merkle,et al.  Extended shapes for the combinatorial design of RNA sequences , 2009, Int. J. Comput. Biol. Drug Des..

[27]  Ali Kaveh,et al.  Graph products for configuration processing of space structures , 2008 .

[28]  Wilfried Imrich,et al.  Approximate graph products , 2009, Eur. J. Comb..

[29]  Janez Zerovnik,et al.  On the Weak Reconstruction of Strong Product Graphs , 2003, Electron. Notes Discret. Math..

[30]  Peter F. Stadler,et al.  Diagonalized Cartesian products of s-prime graphs are s-prime , 2012, Discret. Math..

[31]  Wilfried Imrich,et al.  On Cartesian skeletons of graphs , 2009, Ars Math. Contemp..