
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
K. Fukunaga, S. Yamada, H.S. Stone, T. Kasai, "A Representation of Hypergraphs in the Euclidean Space," IEEE Transactions on Computers, vol. 33, no. 4, pp. 364367, April, 1984.  
BibTex  x  
@article{ 10.1109/TC.1984.1676443, author = {K. Fukunaga and S. Yamada and H.S. Stone and T. Kasai}, title = {A Representation of Hypergraphs in the Euclidean Space}, journal ={IEEE Transactions on Computers}, volume = {33}, number = {4}, issn = {00189340}, year = {1984}, pages = {364367}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1984.1676443}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Representation of Hypergraphs in the Euclidean Space IS  4 SN  00189340 SP364 EP367 EPD  364367 A1  K. Fukunaga, A1  S. Yamada, A1  H.S. Stone, A1  T. Kasai, PY  1984 KW  quadratic assignments problem KW  Circuit design KW  graph space KW  graph theory KW  network expression KW  placement VL  33 JA  IEEE Transactions on Computers ER   
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.
Index Terms:
quadratic assignments problem, Circuit design, graph space, graph theory, network expression, placement
Citation:
K. Fukunaga, S. Yamada, H.S. Stone, T. Kasai, "A Representation of Hypergraphs in the Euclidean Space," IEEE Transactions on Computers, vol. 33, no. 4, pp. 364367, April 1984, doi:10.1109/TC.1984.1676443
Usage of this product signifies your acceptance of the Terms of Use.