Local algorithms for the prime factorization of strong product graphs
From MaRDI portal
Publication:626891
DOI10.1007/s11786-009-0073-yzbMath1205.05222arXiv1705.03823WikidataQ56990949 ScholiaQ56990949MaRDI QIDQ626891
Wilfried Imrich, Peter F. Stadler, Marc Hellmuth, Werner Klöckl
Publication date: 19 February 2011
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.03823
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C76: Graph operations (line graphs, products, etc.)
Related Items
Construction of k-matchings in graph products, Unique square property, equitable partitions, and product-like graphs, On the Cartesian skeleton and the factorization of the strong product of digraphs, A theory of decomposition into prime factors of layered interconnection networks, A local prime factor decomposition algorithm, Recognizing triangulated Cartesian graph products, Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs