Factorization of products of hypergraphs: Structure and algorithms

DOI10.1016/j.tcs.2012.12.050zbMath1259.05144OpenAlexW2077799634MaRDI QIDQ1939276

Yannick Silvestre, Thierry Vallée, Alain Bretto

Publication date: 4 March 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.050

zbMATH Keywords

hypergraphfactorization algorithmCartesian product

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Fast factorization of Cartesian products of (directed) hypergraphs ⋮ Applying a hypergraph to determine the structure of some finite modules ⋮ Strong products of hypergraphs: unique prime factorization theorems and algorithms

This page was built for publication: Factorization of products of hypergraphs: Structure and algorithms