Factorization of Cartesian products of hypergraphs

Authors:
Alain Bretto;Yannick Silvestre
Affiliations:
Université de Caen, Département d'Informatique, GREYC CNRS UMR, Caen cedex, France;Université de Caen, Département d'Informatique, GREYC CNRS UMR, Caen cedex, France
Venue:
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Year:
2010

Citing 3
Cited 1

Recognizing Cartesian graph bundles

Discrete Mathematics
The antimagicness of the Cartesian product of graphs

Theoretical Computer Science
Topics in Graph Theory: Graphs and Their Cartesian Product

Topics in Graph Theory: Graphs and Their Cartesian Product

Factorization of products of hypergraphs: Structure and algorithms

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article we present the L2-section, a tool used to represent a hypergraph in terms of an "advanced graph" and results leading to first algorithm, in O(nm), for a bounded-rank, bounded-degree hypergraph H, which factorizes H in prime factors. The paper puts a premium on the characterization of the prime factors of a hypergraph, by exploiting isomorphisms between the layers in the 2-section, as returned by a standard graph factorization algorithm, such as the one designed by IMRICH and PETERIN.