A Representation of Hypergraphs in the Euclidean Space

IEEE Transactions on Computers

Volumn C-33, Issue 4, 1984, Pages 364-367

  Fukunaga, Kunio ^a   Yamada, Shoichiro ^b   Kasai, Tamotsu ^b   Stone, Harold S ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

^b Osaka Prefecture University   (Japan)

Author keywords

Circuit design; graph space; graph theory; network expression; placement; quadratic assignments problem

Indexed keywords

MATHEMATICAL TECHNIQUES;

EID: 0021405476     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1984.1676443     Document Type: Article

References (9)

1. C. Berge, Graphs and Hypergraphs. Amsterdam: North-Holland, 1976.
2. N. Deo, Graph Theory with Application to Engineering and Computer Science. Englewood Clitfs, NJ: Prentice-Hall, 1974.
3. J.W. Forrester, Industrial Dynamics. Cambridge, MA: MIT Press, 1961.
4. D. A. Calahan, Computer-Aided Network Design. New York: McGraw-Hill, 1972.
5. M. Hanan and J. Kurtzberg, “Placement techniques,” in Design Automation of Digital Systems, M. Breuer, Ed. Englewood Cliffs, NJ: Prentice Hall, 1972.
6. C. Hayashi, “Theory and examples of quantification (II),” J. Inst. of Stat. Math., vol. 4, no. 2, pp. 19–30, 1956.
7. J. M. Kurtzberg, “On approximate methods for the assignment problem,” J. Ass. Comput. Mach., vol. 9, no. 4, pp. 419–439, Oct. 1962.
8. Official Airlines Guide, North American Edition. Oak Brook, IL: Official Airlines Guide, Inc., 1982.
9. E. Parzen, Modern Probability Theory and Its Applications. New York: McGraw-Hill, 1960.