A local prime factor decomposition algorithm
From MaRDI portal
Publication:536219
DOI10.1016/j.disc.2011.02.016zbMath1223.05230arXiv1705.03817OpenAlexW2017823965MaRDI QIDQ536219
Publication date: 16 May 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.03817
backbonestrong product graph\(S\)-primecolor-continuationlocal coveringprime factor decompositionS1-condition
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Construction of k-matchings in graph products ⋮ Covering arrays on product graphs ⋮ Unique square property, equitable partitions, and product-like graphs ⋮ A survey on hypergraph products ⋮ On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs ⋮ Strong products of hypergraphs: unique prime factorization theorems and algorithms ⋮ Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime ⋮ On the Cartesian skeleton and the factorization of the strong product of digraphs ⋮ Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs
Uses Software
Cites Work
- Local algorithms for the prime factorization of strong product graphs
- Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime
- Finding the prime factors of strong direct product graphs in polynomial time
- Graph multiplication
- Weak reconstruction of strong product graphs
- Approximate graph products
- On direct product cancellation of graphs
- On subgraphs of Cartesian product graphs
- Recognizing Cartesian graph bundles
- A fixed box theorem for the cartesian product of graphs and metric spaces
- Algorithm for recognizing Cartesian graph bundles
- On subgraphs of Cartesian product graphs and S-primeness
- On the weak reconstruction of Cartesian-product graphs
- Quasi-independence, homology and the unity of type: a topological theory of characters
- Weak k-reconstruction of cartesian product graphs
- On Cartesian skeletons of graphs
- A note on quasi-robust cycle bases
- A new concept of primeness in graphs
- Factoring cartesian‐product graphs
- On Factorable Extensions and Subgraphs of Prime Graphs
- Cardinal multiplication of structures with a reflexive relation
- An efficient method for decomposition of regular structures using graph products
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A local prime factor decomposition algorithm
