Local algorithms for the prime factorization of strong product graphs
From MaRDI portal
Publication:626891
DOI10.1007/s11786-009-0073-yzbMath1205.05222arXiv1705.03823OpenAlexW2045512440WikidataQ56990949 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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)
Related Items (8)
Construction of k-matchings in graph products ⋮ Unique square property, equitable partitions, and product-like graphs ⋮ Robust Factorizations and Colorings of Tensor Graphs ⋮ Recognizing triangulated Cartesian graph products ⋮ On the Cartesian skeleton and the factorization of the strong product of digraphs ⋮ A theory of decomposition into prime factors of layered interconnection networks ⋮ Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs ⋮ A local prime factor decomposition algorithm
This page was built for publication: Local algorithms for the prime factorization of strong product graphs
