Factorization of Cartesian Product Of Hypergraphs

Alain Bretto (1) , Yannick Sylvestre (2)

1 Equipe CODAG - Laboratoire GREYC - UMR6072
2 GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen

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.

Domaines: Intelligence artificielle [cs.AI]; Traitement du texte et du document

Alain Bretto, Yannick Sylvestre. Factorization of Cartesian Product Of Hypergraphs. 16th Annual International Conference, COCOON 2010, Jul 2010, Nha Trang, Vietnam, Vietnam. pp 173-181, ⟨10.1007/978-3-642-14031-0_20⟩. ⟨hal-01016763⟩