Strong products of hypergraphs: unique prime factorization theorems and algorithms

DOI10.1016/j.dam.2014.02.017zbMath1288.05214arXiv1305.1824OpenAlexW1977019613MaRDI QIDQ2449107

Manuel Noll, Marc Hellmuth, Lydia Ostermeier

Publication date: 6 May 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.1824

zbMATH Keywords

hypergraphstrong productnormal productCartesian skeletonprime factor decomposition algorithms

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Associativity and non-associativity of some hypergraph products ⋮ Fast factorization of Cartesian products of (directed) hypergraphs ⋮ On the Cartesian skeleton and the factorization of the strong product of digraphs

Cites Work

• A local prime factor decomposition algorithm
• Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime
• Finding the prime factors of strong direct product graphs in polynomial time
• Factorization of products of hypergraphs: Structure and algorithms
• A survey on hypergraph products
• On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs
• On Cartesian skeletons of graphs
• Cardinal multiplication of structures with a reflexive relation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strong products of hypergraphs: unique prime factorization theorems and algorithms