Cartesian product of hypergraphs: properties and algorithms
نویسندگان
چکیده
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product. Hypergraphs were introduced as a generalization of graphs and the definition of Cartesian products extends naturally to them. In this paper, we give new properties and algorithms concerning coloring aspects of Cartesian products of hypergraphs. We also extend a classical prime factorization algorithm initially designed for graphs to connected conformal hypergraphs using 2-sections of hypergraphs.
منابع مشابه
Fast factorization of Cartesian products of (directed) hypergraphs
Cartesian products of graphs and hypergraphs have been studied since the 1960s. For (un)directed hypergraphs, unique prime factor decomposition (PFD) results with respect to the Cartesian product are known. However, there is still a lack of algorithms, that compute the PFD of directed hypergraphs with respect to the Cartesian product. In this contribution, we focus on the algorithmic aspects fo...
متن کاملFast Factorization of Cartesian products of Hypergraphs
Cartesian products of graphs and hypergraphs have been studied since the 1960s. For (un)directed hypergraphs, unique prime factor decomposition (PFD) results with respect to the Cartesian product are known. However, there is still a lack of algorithms, that compute the PFD of directed hypergraphs with respect to the Cartesian product. In this contribution, we focus on the algorithmic aspects fo...
متن کاملStrong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms
It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time. Essential for the PFD computation is the construction of the so-called Cartesian skeleton of the graphs under investigation. In this contribution, we show that every connected thin hypergraph H has a unique prime fact...
متن کاملThe Cartesian product of hypergraphs
We show that every simple, (weakly) connected, possibly directed and infinite, hypergraph has a unique prime factor decomposition with respect to the (weak) Cartesian product, even if it has infinitely many factors. This generalizes previous results for graphs and undirected hypergraphs to directed and infinite hypergraphs. The proof adopts the strategy outlined by Imrich and Žerovnik for the c...
متن کامل(Relaxed) Product Structures of Graphs and Hypergraphs
We investigate graphs and hypergraphs that have (relaxed) product structures. In the class of graphs, we discuss in detail RSP-relations, a relaxation of relations fulfilling the square property and therefore of the product relation σ, that identifies the copies of the prime factors of a graph w.r.t. the Cartesian product. For K2,3-free graphs finest RSP-relations can be computed in polynomial-...
متن کامل