메뉴 건너뛰기




Volumn 10, Issue 1, 2004, Pages 46-57

Combining hierarchy and energy for drawing directed graphs

Author keywords

Directed graph drawing; Fiedler vector; Force directed layout; Hierarchy energy; Minimum linear arrangement

Indexed keywords

DIRECTED GRAPH DRAWING; FIEDLER VECTOR; FORCE DIRECTED LAYOUT; HIERARCHY ENERGY; MINIMUM LINEAR ARRANGEMENT;

EID: 4243182673     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2004.1260757     Document Type: Article
Times cited : (32)

References (23)
  • 2
    • 0030264246 scopus 로고    scopus 로고
    • Drawing graphs nicely using simulated annealing
    • R. Davidson and D. Harel, "Drawing Graphs Nicely Using Simulated Annealing," ACM Trans. Graphics, vol. 15, pp. 301331, 1996.
    • (1996) ACM Trans. Graphics , vol.15 , pp. 301331
    • Davidson, R.1    Harel, D.2
  • 4
    • 0344704289 scopus 로고    scopus 로고
    • A Survey on graph layout problems
    • J. Diaz, J. Petit, and M. Serna, "A Survey on Graph Layout Problems," ACM Computing Surveys, vol. 34, pp. 313-356, 2002.
    • (2002) ACM Computing Surveys , vol.34 , pp. 313-356
    • Diaz, J.1    Petit, J.2    Serna, M.3
  • 5
    • 0001070640 scopus 로고
    • A heuristic for graph drawing
    • P. Eades, "A Heuristic for Graph Drawing," Congressus Numer-antium, vol. 42, pp. 149-160, 1984.
    • (1984) Congressus Numer-antium , vol.42 , pp. 149-160
    • Eades, P.1
  • 9
    • 0014869120 scopus 로고
    • An r-dimensional quadratic placement algorithm
    • K.M. Hall, "An r-Dimensional Quadratic Placement Algorithm," Management Science, vol. 17, pp. 219-229, 1970.
    • (1970) Management Science , vol.17 , pp. 219-229
    • Hall, K.M.1
  • 10
    • 0039844879 scopus 로고
    • Exact and heuristic algorithms for 2-layer straightline crossing minimization
    • M. Jünger and P. Mutzel, "Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization," Proc. Graph Drawing (GD '95), pp. 337-348, 1995.
    • (1995) Proc. Graph Drawing (GD '95) , pp. 337-348
    • Jünger, M.1    Mutzel, P.2
  • 11
    • 0024640140 scopus 로고
    • An algorithm for drawing general undirected graphs
    • T. Kamada and S. Kawai, "An Algorithm for Drawing General Undirected Graphs," Information Processing Letters, vol. 31, pp. 715, 1989.
    • (1989) Information Processing Letters , vol.31 , pp. 715
    • Kamada, T.1    Kawai, S.2
  • 12
    • 84947922995 scopus 로고
    • Constraint-based spring-model algorithm for graph layout
    • T. Kamps, J. Kleinz, and J. Read, "Constraint-Based Spring-Model Algorithm for Graph Layout," Proc. Graph Drawing (GD '95), pp. 349-360, 1995.
    • (1995) Proc. Graph Drawing (GD '95) , pp. 349-360
    • Kamps, T.1    Kleinz, J.2    Read, J.3
  • 20
    • 84957578504 scopus 로고
    • A simple and unified method for drawing graphs: Magnetic-spring algorithm
    • K. Sugiyama and K. Misue, "A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm," Proc. Graph Drawing (GD '94), pp. 364-375, 1995.
    • (1995) Proc. Graph Drawing (GD '94) , pp. 364-375
    • Sugiyama, K.1    Misue, K.2
  • 22
    • 84962795554 scopus 로고
    • How to draw a graph
    • W.T. Tutte, "How to Draw a Graph," Proc. London Math. Soc., vol. 13, pp. 743-768, 1963.
    • (1963) Proc. London Math. Soc. , vol.13 , pp. 743-768
    • Tutte, W.T.1


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