Cartesian product of hypergraphs: properties and algorithms

Details Cartesian product of hypergraphs: properties and algorithms Cartesian product of hypergraphs: properties and algorithms

2009-09-28

arxiv.org/abs/0909.5032v1

EPTCS 4, 2009, pp. 22-28

Computer Science

Discrete Mathematics

Scientific paper

10.4204/EPTCS.4.3

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.

Affiliated with

Also associated with

No associations

Rating

Cartesian product of hypergraphs: properties and algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cartesian product of hypergraphs: properties and algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cartesian product of hypergraphs: properties and algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-234596