A Representation of Hypergraphs in the Euclidean Space

Authors:
K. Fukunaga;S. Yamada;H. S. Stone;T. Kasai
Affiliations:
Department of Electrical and Computer E Engineering, University of Massachusetts, Amherst, MA 01003, and the College of Engineering, University of Osaka Prefecture;-;-;-
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 3
Cited 2

On Approximation Methods for the Assignment Problem

Journal of the ACM (JACM)
Graphs and Hypergraphs

Graphs and Hypergraphs
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Assignment of job modules onto array processors

IEEE Transactions on Computers
Placement of circuit modules using a graph space approach

DAC '83 Proceedings of the 20th Design Automation Conference

Quantified Score

Hi-index	14.98

Visualization

Abstract

This paper introduces a graph space that shows concisely the relative weights among combinations of vertices of a given hypergraph. (A hypergraph is a graph in which one edge may connect two or more vertices.) The hypergraph is represented by a collection of points in graph space such that the distance between vertices in graph space reflects the weights of the edges between vertices of the original hypergraph. Vertices of the hypergraph that are connected by edges with large weights are mapped to nearby points in graph space. Thus, graph space reveals properties of the connectivity of vertices in the hypergraph. A natural application of graph space is the placement of modules in computer systems since strongly coupled modules are transformed into nearby points in graph space. The graph of the airlines network in the United States is taken as an example of a hypergraph, and the paper illustrates the corresponding graph space.