메뉴 건너뛰기




Volumn 177, Issue 14, 2007, Pages 2821-2844

A new algorithm for removing node overlapping in graph visualization

Author keywords

Force transfer; Graph layout; Layout adjustment; Overlapping nodes

Indexed keywords

GRAPH THEORY; NUMERICAL METHODS; PROBLEM SOLVING;

EID: 34247540849     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.02.016     Document Type: Article
Times cited : (44)

References (26)
  • 3
    • 0030264246 scopus 로고    scopus 로고
    • Drawing graphs nicely using simulated annealing
    • Davidson R., and Harel D. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics 15 4 (1996) 301-331
    • (1996) ACM Transactions on Graphics , vol.15 , Issue.4 , pp. 301-331
    • Davidson, R.1    Harel, D.2
  • 4
    • 0036605140 scopus 로고    scopus 로고
    • Two-dimensional packing algorithms for layout of disconnected graphs
    • Dogrusoz U. Two-dimensional packing algorithms for layout of disconnected graphs. Information Sciences 143 (2002) 147-158
    • (2002) Information Sciences , vol.143 , pp. 147-158
    • Dogrusoz, U.1
  • 6
    • 85049919974 scopus 로고    scopus 로고
    • C. Dwork, R. Kumar, M. Naor, D. Sivakumar, Rank aggregation methods for the Web, in: Proceedings of the 10th International World Wide Web Conference, Hong Kong, 2001.
  • 7
    • 34247511448 scopus 로고    scopus 로고
    • P. Eades, W. Lai, Algorithms for disjoint node images, in: Proceedings of the 15th Australian Computer Science Conference, Hobart, 1992, pp. 253-265.
  • 9
    • 34247469685 scopus 로고    scopus 로고
    • P. Eades, W. Lai, K. Misue, K. Sugiyama, Preserving the mental map of a diagram. Technical report IIAS-RR-91-16E, International Institute for Advanced Study of Social Information Science, Fujitsu Laboratories Ltd, 1991.
  • 10
    • 27644433184 scopus 로고    scopus 로고
    • Layout algorithm for signaling pathways
    • Genc B., and Dogrusoz U. Layout algorithm for signaling pathways. Information Sciences 176 (2006) 135-149
    • (2006) Information Sciences , vol.176 , pp. 135-149
    • Genc, B.1    Dogrusoz, U.2
  • 11
    • 0000411214 scopus 로고
    • Tabu search, Part I
    • Glover F. Tabu search, Part I. ORSA Journal on Computing 1 3 (1989) 190-206
    • (1989) ORSA Journal on Computing , vol.1 , Issue.3 , pp. 190-206
    • Glover, F.1
  • 13
    • 0141943185 scopus 로고    scopus 로고
    • D. Harel, Y. Koren, Drawing graphs with non-uniform Vertices, in: Proceedings of the Working Conference on Advanced Visual Interfaces (AVI'02), ACM Press, 2002, pp. 157-166.
  • 14
    • 0011777545 scopus 로고    scopus 로고
    • Constrained graph layout
    • He W., and Marriott K. Constrained graph layout. Constraints 3 4 (1998) 289-314
    • (1998) Constraints , vol.3 , Issue.4 , pp. 289-314
    • He, W.1    Marriott, K.2
  • 15
    • 34247530730 scopus 로고    scopus 로고
    • W. He, K. Marriott, Removing node overlapping using constrained optimization, in: Proceedings of the 21st Australian Computer Science Conference, Perth, 1998, pp. 169-180.
  • 16
    • 34247515170 scopus 로고    scopus 로고
    • X. Huang, Filtering, clustering and dynamic layout for graph visualization, Ph.D. thesis, Swinburne University of Technology, 2004.
  • 17
    • 33646127156 scopus 로고    scopus 로고
    • Clustering graphs for visualization via node similarities
    • Huang X., and Lai W. Clustering graphs for visualization via node similarities. Journal of Visual Languages and Computing 17 (2006) 225-253
    • (2006) Journal of Visual Languages and Computing , vol.17 , pp. 225-253
    • Huang, X.1    Lai, W.2
  • 18
    • 34047136081 scopus 로고    scopus 로고
    • Software architecture graphs as complex networks: a novel partitioning scheme to measure stability and evolution
    • 10.1016/j.ins.2007.01.021
    • Jenkins S., and Kirk S.R. Software architecture graphs as complex networks: a novel partitioning scheme to measure stability and evolution. Information Sciences (2007) 10.1016/j.ins.2007.01.021
    • (2007) Information Sciences
    • Jenkins, S.1    Kirk, S.R.2
  • 20
    • 0036469921 scopus 로고    scopus 로고
    • A layout adjustment problem for disjoint rectangles preserving orthogonal order
    • Kunihiko H., Michilo I., Toshimitsu M., and Hideo F. A layout adjustment problem for disjoint rectangles preserving orthogonal order. Systems and Computers in Japan 33 2 (2002) 31-42
    • (2002) Systems and Computers in Japan , vol.33 , Issue.2 , pp. 31-42
    • Kunihiko, H.1    Michilo, I.2    Toshimitsu, M.3    Hideo, F.4
  • 21
    • 34247476045 scopus 로고    scopus 로고
    • W. Lai, Building interactive diagram applications, Ph.D. Thesis, University of Newcastle, 1993.
  • 22
    • 0037203618 scopus 로고    scopus 로고
    • Removing edge-node intersections in drawings of graphs
    • Lai W., and Eades P. Removing edge-node intersections in drawings of graphs. Information Processing Letters 81 (2002) 105-111
    • (2002) Information Processing Letters , vol.81 , pp. 105-111
    • Lai, W.1    Eades, P.2
  • 24
    • 0037382018 scopus 로고    scopus 로고
    • Removing node overlapping in graph layout using constrained optimization
    • Marriott K., Stuckey P., Tam V., and He W. Removing node overlapping in graph layout using constrained optimization. Constraints 8 (2003) 43-171
    • (2003) Constraints , vol.8 , pp. 43-171
    • Marriott, K.1    Stuckey, P.2    Tam, V.3    He, W.4
  • 25
    • 34247538913 scopus 로고    scopus 로고
    • M-F. Natasa, S. Ralph, SmartView: Flexible viewing of Web page contents, in: Proceedings of the 11th International World Wide Web Conference, Hawaii, USA, 2002.
  • 26
    • 34247516774 scopus 로고    scopus 로고
    • M.D. Story, A.H. Müller, Graph layout adjustment strategies, in: Symposium on Graph Drawing, GD'95, LNCS 1027, Springer-Verlag, 1995, pp. 487-499.


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