HYPER-GRAPH DECOMPOSITION METHOD TO DIGRAPH

AKIRA KOBASHI

Abstract. Hyper-gaph, especially whose edges are connecting 3 nodes can be decomposed into ordinary digraph. We are going to describe a methodology to convert hyper-graphs into ordinal digrahs. The purpose of this method is Max-Cut in hyper-graphs, not digraphs.

1. Introduction to Hyper-graph In mathematics, a hyper-graph is a generalization of a graph in which an edge can connect any number of vertices. Formally, a hyper-graph H is a pair H = (X,E) where X is a set of elements called nodes or vertices, and E is a set of non-empty subsets of X called hyper-edges or edges. Therefore, E is a subset of P (X ) \{}, where P (X ) is the power set of X. While graph edges are pairs of nodes, hyperedges are arbitrary sets of nodes, and can therefore contain an arbitrary number of nodes. However, it is often desirable to study hyper-graphs where all hyper-edges have the same cardinality; a k-uniform hyper-graph is a hyper-graph such that all its hyper-edges have size k. (In other words, it is a collection of sets of size k.) So a 2-uniform hyper-graph is a graph, a 3-uniform hyper-graph is a collection of unordered triples, and so on. A hyper-graph is also called a set system or a family of sets drawn from the universal set X. The dierence between a set system and a hyper-graph (which is not well dened) is in the questions being asked. Hypergraph theory tends to concern questions similar to those of graph theory, such as connectivity and colorability, while the theory of set systems tends to ask non-graph-theoretical questions, such as those of Sperner theory. There are variant denitions; sometimes edges must not be empty, and sometimes multiple edges, with the same set of nodes, are allowed. Hyper-graphs can be viewed as incidence structures. In particular, there is a bipartite incidence graph or Levi graph corresponding to every hyper-graph, and conversely, most, but not all, bipartite graphs can be regarded as incidence graphs of hyper-graphs. Hyper-graphs have many other names. In computational geometry, a hyper-graph may sometimes be called a range space and then the hyper-edges are called ranges.[1] In cooperative game theory, hyper-graphs are called simple games (voting games); this notion is applied to solve problems in social choice theory. In some literature edges are referred to as hyper-links or connectors.[2] Special kinds of hyper-graphs include, besides k-uniform ones, clutters, where no edge appears as a subset of another edge; and abstract simplicial complexes, which contain all subsets of every edge. The collection of hyper-graphs is a category with hyper-graph homomorphisms as morphisms [1]. 2. Hyper-Graph Decomposition Method Jeonghun Cho et.al[3, 4]. applied Maximum Spanning Tree to a digraph MaxCut problem. While, this method cannot be applied to hyper-graphs. Then we are going to describe how to decompose a hyper-graph. Assume a hyper-graph
Date : Dec. 14. 2013.
1

AKIRA KOBASHI

Figure 1. Hyper-graph before decomposition

Figure 2. Hyper-graph after decomposition G = (V, E ). Hyper-edges are decomposed into ordinary digraphs edges. Where u, v, w are nodes and (u, v, w) is any hyper-edges, e = {e|e = (u, v, w), e E } shall e) w(e) w(e) be expanded as e = {(u, v ) = w( 2 , (v, w ) = 2 , (w, v ) = 2 } Next, obtained digraphs can be Max-Cut by semidenite programming. Briey speaking, double those hyper-edges shall be half of the value, and add to ordinary edges. An example hyper-graph before decompositioin is shown in gure 1 and after decompositioin is shown in gure 2. 3. Conclusion We described how to Max-Cut a hyper-graph using decomposition. This theory will realize application of massively parallel processing [2] in the future. References
[1] Wikipedia: Hyper-graph, http://en.wikipedia.org/wiki/Hypergraph [2] Masami Nakajima Hideyuki Noda et.al., A 40GOPS 250mW Massively Parallel Processor Based on Matrix Architecture, Proceedings of ISSCC, pp. 410-411, 2006. [3] Jeonghun Cho, Yunheung Peak, and David Whalley, Register and memory assignment for non-orthogonal architectures via graph coloring and MST algorithms, ACM SIGPLAN Notices, Vol. 37, Issue 7, pp.30-138, 2002. [4] Jeonghun Cho, Yunheung Peak, and David Whalley, Fast memory bank assignment for exedpoint digital signal processors, ACM Transactions on Design Automation of Electronic Systems, Vol. 9, No.1, pp 52-74, 2004.