Art

J-GLOBAL ID：200902173384976011   Reference number：95A0672160

An Algorithm for Simple Undirected Graph Drawing.

情報の可視化 単純無向グラフ自動描画アルゴリズム

Author (3)： SUZUSE KAZUHIKO (慶応大 大学院) ,  KAMATA TOMIHISA (ACCESS) ,  ENOMOTO HIKOE (慶応大 理工)
Material： コンピュータソフトウェア  (Computer Software)
Volume： 12  Issue： 4  Page： 45-55  Publication year： Jul. 1995 
JST Material Number： Y0628A  ISSN： 0289-6540  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： JAPANESE (JA)

Thesaurus term： undirected graph ,...

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=95A0672160&from=J-GLOBAL&jstjournalNo=Y0628A") }}

JST classification (1)： Graphic and image processing in general  (JE04010I)

Reference (15)：

• CHIBA, N. Drawing Planar Graphs Nicely. Acta Informatica. 1985, 22, 2, 187-201
• EADES, P. A Heuristic for Graph Drawing. Congressus Numerantium. 1984, 42, 149-160
• EADES, P. Algorithms for Automatic Graph Drawing : An Annotated Bibliography. Technical Report CS-89-09. 1989
• FRUCHTERMAN, T. M. J. Graph Drawing by Force-directed Placement. Software-Practice and Experience. 1991, 21, 11, 1129-1164
• GANSER, E. R. A Program that Draws Directed Graphs. Software-Practice and Experience. 1988, 18, 11, 1047-1062

Terms in the title (3)： 可視化 ,  無向グラフ ,  アルゴリズム