메뉴 건너뛰기




Volumn 21, Issue 4, 1991, Pages 876-892

Visualization of Structural Information: Automatic Drawing of Compound Digraphs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; GEOMETRY; GRAPH THEORY; HEURISTIC METHODS; VISUALIZATION;

EID: 0026185069     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/21.108304     Document Type: Article
Times cited : (164)

References (26)
  • 1
    • 0039126979 scopus 로고
    • Algorithms for automatic graph drawing: An annotated bibliography
    • Dept. Comput. Sci., Brown Univ., Providence, RI, Tech. Rep. no. CS-89-09
    • P. Eades and R. Tamassia, “Algorithms for automatic graph drawing: An annotated bibliography,” Dept. Comput. Sci., Brown Univ., Providence, RI, Tech. Rep. no. CS-89-09, 1989.
    • (1989)
    • Eades, P.1    Tamassia, R.2
  • 3
    • 84941535142 scopus 로고
    • A study on supporting diagrammatical thinking process: Toward developing informatics for thinking enhancement
    • Fujitsu Ltd., Res. Summary Rep. no. 24 (Part I), no. 25 (Part II), pp. 1-115, (in Japanese).
    • K. Sugiyama, “A study on supporting diagrammatical thinking process: Toward developing informatics for thinking enhancement,” Int. Institute for Advanced Study of Social Inform. Sci., Fujitsu Ltd., Res. Summary Rep. no. 24 (Part I), pp. 1-64, no. 25 (Part II), pp. 1-115, 1988, (in Japanese).
    • (1988) Int. Institute for Advanced Study of Social Inform. Sci. , pp. 1-64
    • Sugiyama, K.1
  • 4
    • 42649100318 scopus 로고
    • ‘Good’ graphic interfaces for ‘good’ idea organizers
    • in Proc. IFIP TC13, Third Int. Conf. Human-Computer Interaction, Cambridge, UK, Aug. 27-31
    • K. Sugiyama and K. Misue, “ ‘Good’ graphic interfaces for ‘good’ idea organizers,” in Proc. IFIP TC13, Third Int. Conf. Human-Computer Interaction, Cambridge, UK, Aug. 27-31, 1990, pp. 521-526.
    • (1990) , pp. 521-526
    • Sugiyama, K.1    Misue, K.2
  • 5
    • 33645619735 scopus 로고
    • Automatic layout of large directed graphs
    • Dept. Comput. Science, Univ. Washington, Seattle, Tech. Rep. no. 87-07-08
    • E. B. Messinger, “Automatic layout of large directed graphs,” Dept. Comput. Science, Univ. Washington, Seattle, Tech. Rep. no. 87-07-08, pp. 1-198, 1988.
    • (1988) , pp. 1-198
    • Messinger, E.B.1
  • 6
    • 84941535143 scopus 로고
    • Compound graphs as abstraction of card systems and their hierarchical drawing
    • Inform. Processing Soc., Japan, Research Report 88-GC-32-2, (in Japanese)
    • K. Misue and K. Sugiyama, “Compound graphs as abstraction of card systems and their hierarchical drawing,” Inform. Processing Soc., Japan, Research Report 88-GC-32-2, 1988, (in Japanese).
    • (1988)
    • Misue, K.1    Sugiyama, K.2
  • 7
    • 33745311986 scopus 로고
    • Freehand-like drawing of compound graphs: A fundamental technique for computer aided abduction
    • (in Japanese)
    • K. Misue and K. Sugiyama, “Freehand-like drawing of compound graphs: A fundamental technique for computer aided abduction,” in Proc. 37th Conf. Inf. Proc. Soc. Jpn., 1988, pp. 1304-1305, (in Japanese).
    • (1988) Proc. 37th Conf. Inf. Proc. Soc. Jpn. , pp. 1304-1305
    • Misue, K.1    Sugiyama, K.2
  • 8
    • 84913033029 scopus 로고
    • Visualizing structural information: Hierarchical drawing of a compound digraph
    • Fujitsu Ltd., Res. Rep. no. 86
    • K. Sugiyama and K. Misue, “Visualizing structural information: Hierarchical drawing of a compound digraph,” Int. Institute for Advanced Study Social Inform. Sci., Fujitsu Ltd., Res. Rep. no. 86, pp. 1-49, 1989.
    • (1989) Int. Institute for Advanced Study Social Inform. Sci. , pp. 1-49
    • Sugiyama, K.1    Misue, K.2
  • 9
    • 0019530043 scopus 로고
    • Method for visual understanding of hierarchical system structures
    • K. Sugiyama, S. Tagawa, and M. Toda, “Method for visual understanding of hierarchical system structures,” IEEE Trans. Syst., Man, Cybern., vol. SMC-11, no. 2, pp. 109-125, 1981.
    • (1981) IEEE Trans. Syst., Man, Cybern. , vol.SMC-11 , Issue.2 , pp. 109-125
    • Sugiyama, K.1    Tagawa, S.2    Toda, M.3
  • 10
    • 4043074371 scopus 로고
    • A cognitive approach for graph drawing
    • K. Sugiyama, “A cognitive approach for graph drawing,” Cybern. Syst., vol. 18, no. 6, pp. 447-488, 1987.
    • (1987) Cybern. Syst. , vol.18 , Issue.6 , pp. 447-488
    • Sugiyama, K.1
  • 11
    • 0017516514 scopus 로고
    • Crossing theory and hierarchy mapping
    • J. N. Warfield, “Crossing theory and hierarchy mapping,” IEEE Trans. Syst., Man, Cybern., vol. SMC-7, no. 7, pp. 505-523, 1977.
    • (1977) IEEE Trans. Syst., Man, Cybern. , vol.SMC-7 , Issue.7 , pp. 505-523
    • Warfield, J.N.1
  • 14
    • 84941535144 scopus 로고
    • collected papers of C. S. Peirce, vol. II. Cambridge, MA: Harvard Univ. Press
    • C. Hartshorne and P. Weiss, Ed., collected papers of C. S. Peirce, vol. II. Cambridge, MA: Harvard Univ. Press, 1978.
    • (1978)
    • Hartshorne, C.1    Weiss, P.2
  • 15
    • 84941535145 scopus 로고
    • KJ method
    • (in Japanese)
    • J. Kawakita, “KJ method,” Chuokoron-sha, 1986 (in Japanese).
    • (1986) Chuokoron-sha
    • Kawakita, J.1
  • 18
    • 0024016415 scopus 로고
    • On visual formalisms
    • D. Harel, “On visual formalisms,” Commun. ACM, vol. 31, no. 5, pp. 514-530, 1988.
    • (1988) Commun. ACM , vol.31 , Issue.5 , pp. 514-530
    • Harel, D.1
  • 19
    • 0003780715 scopus 로고
    • Reading, MA: Addison-Wesley
    • F. Harary, Graph Theory. Reading, MA: Addison-Wesley, 1972.
    • (1972) Graph Theory
    • Harary, F.1
  • 20
    • 0004201430 scopus 로고
    • Rockville, MD: Computer Science Press
    • S. Even, Graph Algorithms. Rockville, MD: Computer Science Press, 1979.
    • (1979) Graph Algorithms
    • Even, S.1
  • 21
    • 49049130359 scopus 로고
    • The NP-completeness column: An ongoing guide
    • D. S. Johnson, “The NP-completeness column: An ongoing guide,” J. Algorithms, vol. 3, pp. 89-99, 1982.
    • (1982) J. Algorithms , vol.3 , pp. 89-99
    • Johnson, D.S.1
  • 23
    • 0000399523 scopus 로고
    • Minimum feedback arc and vertex sets of a directed graph
    • A. Lempel and I. Cederbaum, “Minimum feedback arc and vertex sets of a directed graph,” IEEE Trans. Circuit Theory, vol. CT-13, no. 4, pp. 339-403, 1966.
    • (1966) IEEE Trans. Circuit Theory , vol.CT-13 , Issue.4 , pp. 339-403
    • Lempel, A.1    Cederbaum, I.2
  • 25
    • 0022075651 scopus 로고
    • Structuring information for understanding complex systems: A basis for decision making
    • K. Sugiyama and M. Toda, “Structuring information for understanding complex systems: A basis for decision making,” Fujitsu Sci. Tech. 7., vol. 14, no. 2, pp. 144-164, 1985.
    • (1985) Fujitsu Sci. Tech. 7. , vol.14 , Issue.2 , pp. 144-164
    • Sugiyama, K.1    Toda, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.