Cartesian product of hypergraphs: properties and algorithms
Discrete Mathematics
2009-09-29 v1 Data Structures and Algorithms
Abstract
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.
Keywords
Cite
@article{arxiv.0909.5032,
title = {Cartesian product of hypergraphs: properties and algorithms},
author = {Alain Bretto and Yannick Silvestre and Thierry Vallée},
journal= {arXiv preprint arXiv:0909.5032},
year = {2009}
}