메뉴 건너뛰기




Volumn 309, Issue 7, 2009, Pages 1895-1908

Constrained graph layout by stress majorization and gradient projection

Author keywords

Constraints; Gradient projection; Graph drawing; Stress majorization

Indexed keywords

DRAWING (GRAPHICS);

EID: 61749086006     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.12.103     Document Type: Article
Times cited : (22)

References (26)
  • 4
    • 84957380248 scopus 로고    scopus 로고
    • A bayesian paradigm for dynamic graph layout
    • Proc. 5th Int. Symp. Graph Drawing. GD'97, Springer
    • Brandes U., and Wagner D. A bayesian paradigm for dynamic graph layout. Proc. 5th Int. Symp. Graph Drawing. GD'97. LNCS vol. 1353 (1997), Springer 236-247
    • (1997) LNCS , vol.1353 , pp. 236-247
    • Brandes, U.1    Wagner, D.2
  • 9
    • 84860053662 scopus 로고    scopus 로고
    • Fast node overlap removal (Addendum)
    • Technical Report
    • T. Dwyer, K. Marriott, P.J. Stuckey, Fast node overlap removal (Addendum), Technical Report, Monash University. http://www.csse.monash.edu.au/~tdwyer/FNORAddendum.pdf
    • Dwyer, T.1    Marriott, K.2    Stuckey, P.J.3
  • 10
    • 33745638341 scopus 로고    scopus 로고
    • Stress majorization with orthogonal ordering constraints
    • GD'05, Springer
    • Dwyer T., Koren Y., and Marriott K. Stress majorization with orthogonal ordering constraints. Proc. 13th Int. Symp. Graph Drawing. GD'05 (2006), Springer 141-152
    • (2006) Proc. 13th Int. Symp. Graph Drawing , pp. 141-152
    • Dwyer, T.1    Koren, Y.2    Marriott, K.3
  • 12
    • 33845647173 scopus 로고    scopus 로고
    • IPSep-CoLa: an incremental procedure for separation constraint layout of graphs
    • Dwyer T., Koren Y., and Marriott K. IPSep-CoLa: an incremental procedure for separation constraint layout of graphs. IEEE Trans. Visualization Comput. Graphics 12 5 (2006) 821-828
    • (2006) IEEE Trans. Visualization Comput. Graphics , vol.12 , Issue.5 , pp. 821-828
    • Dwyer, T.1    Koren, Y.2    Marriott, K.3
  • 13
    • 0006767318 scopus 로고    scopus 로고
    • Navigating clustered graphs using force-directed methods
    • Eades P., and Huang M.L. Navigating clustered graphs using force-directed methods. J. Graph Algorithms Appl. 4 12 (2000) 157-181
    • (2000) J. Graph Algorithms Appl. , vol.4 , Issue.12 , pp. 157-181
    • Eades, P.1    Huang, M.L.2
  • 14
    • 0012758383 scopus 로고
    • A new heuristic for the feedback arc set problem
    • Eades P., and Lin X. A new heuristic for the feedback arc set problem. Australian J. Combin. 12 (1995) 15-26
    • (1995) Australian J. Combin. , vol.12 , pp. 15-26
    • Eades, P.1    Lin, X.2
  • 16
    • 24144496062 scopus 로고    scopus 로고
    • Graph drawing by stress majorization
    • Proc. 12th Int. Symp. Graph Drawing. GD'04, Springer
    • Gansner E., Koren Y., and North S. Graph drawing by stress majorization. Proc. 12th Int. Symp. Graph Drawing. GD'04. LNCS vol. 3383 (2004), Springer 239-250
    • (2004) LNCS , vol.3383 , pp. 239-250
    • Gansner, E.1    Koren, Y.2    North, S.3
  • 17
    • 84957633546 scopus 로고    scopus 로고
    • Constrained graph layout
    • Proc. 3rd Int. Symp. Graph Drawing. GD'96, Springer
    • He W., and Marriott K. Constrained graph layout. Proc. 3rd Int. Symp. Graph Drawing. GD'96. LNCS vol. 1190 (1996), Springer 217-232
    • (1996) LNCS , vol.1190 , pp. 217-232
    • He, W.1    Marriott, K.2
  • 18
    • 0011777545 scopus 로고    scopus 로고
    • Constrained graph layout
    • He W., and Marriott K. Constrained graph layout. Constraints 3 (1998) 289-314
    • (1998) Constraints , vol.3 , pp. 289-314
    • He, W.1    Marriott, K.2
  • 19
    • 24144446983 scopus 로고    scopus 로고
    • The metro map layout problem
    • Proc. 12th Int. Symp. Graph Drawing. GD'04, Springer
    • Hong S., Merrick D., and Nascimento H. The metro map layout problem. Proc. 12th Int. Symp. Graph Drawing. GD'04. LNCS vol. 3383 (2004), Springer 482-491
    • (2004) LNCS , vol.3383 , pp. 482-491
    • Hong, S.1    Merrick, D.2    Nascimento, H.3
  • 20
    • 0024640140 scopus 로고
    • An algorithm for drawing general undirected graphs
    • Kamada T., and Kawai S. An algorithm for drawing general undirected graphs. Inform. Process. Lett. 31 (1989) 7-15
    • (1989) Inform. Process. Lett. , vol.31 , pp. 7-15
    • Kamada, T.1    Kawai, S.2
  • 26
    • 0036354771 scopus 로고    scopus 로고
    • Warm-start strategies in interior-point methods for linear programming
    • Yildirim E.A., and Wright S.J. Warm-start strategies in interior-point methods for linear programming. SIAM J. Optim. 12 3 (2002) 782-810
    • (2002) SIAM J. Optim. , vol.12 , Issue.3 , pp. 782-810
    • Yildirim, E.A.1    Wright, S.J.2


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