메뉴 건너뛰기




Volumn , Issue , 2007, Pages 101-108

Placing connected components of disconnected graphs

Author keywords

Graph drawing; Placing connected components; Two dimensional packing

Indexed keywords

ALGORITHMS; INTERACTIVE COMPUTER GRAPHICS; QUALITY CONTROL; VISUALIZATION;

EID: 34547263654     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APVIS.2007.329283     Document Type: Conference Paper
Times cited : (7)

References (21)
  • 1
    • 0016881715 scopus 로고
    • Nesting Two-Dimensional Shapes in Rectangular Modules
    • M. Adamowicz and A. Albano, "Nesting Two-Dimensional Shapes in Rectangular Modules", Computer Aided Design, vol. 8, pp. 27-33, 1976.
    • (1976) Computer Aided Design , vol.8 , pp. 27-33
    • Adamowicz, M.1    Albano, A.2
  • 4
    • 21144463978 scopus 로고
    • Using a Tabu Search Approach for Solving the Two-Dimensional Irregular Cutting Problem
    • H. P. Blazewicz, J. Walkowiak, and R. Walkowiak, "Using a Tabu Search Approach for Solving the Two-Dimensional Irregular Cutting Problem", Annals of Operations Research, vol. 41, pp. 313-325, 1993.
    • (1993) Annals of Operations Research , vol.41 , pp. 313-325
    • Blazewicz, H.P.1    Walkowiak, J.2    Walkowiak, R.3
  • 5
    • 34547290423 scopus 로고    scopus 로고
    • 2NA Nesting Software
    • 2NA/ (accessed September, document)http://www.boeing.com/phantom
    • Boeing, "2NA Nesting Software" (WWW document), http://www.boeing.com/phantom/2NA/ (accessed September 2006).
    • (2006)
    • Boeing1
  • 7
    • 0002528075 scopus 로고
    • Approximation Algorithms for Bin Packing: An Updated Survey
    • G. Ausiello, M. Lucertini, and P. Serafini editors, Springer, Vienna, pp
    • E. G. Coffman, M. R. Garey, and D. S. Johnson, "Approximation Algorithms for Bin Packing: An Updated Survey", in: G. Ausiello, M. Lucertini, and P. Serafini (editors), Algorithm Design for Computer Systems Design, Springer, Vienna, pp. 49-106, 1984.
    • (1984) Algorithm Design for Computer Systems Design , pp. 49-106
    • Coffman, E.G.1    Garey, M.R.2    Johnson, D.S.3
  • 8
    • 0000586245 scopus 로고
    • Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
    • E. G. Coffman, M. R. Garey, D. S. Johnson, and R. E. Tarjan, "Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms", SIAM Journal on Computing, vol. 9(4), pp. 808-826, 1990.
    • (1990) SIAM Journal on Computing , vol.9 , Issue.4 , pp. 808-826
    • Coffman, E.G.1    Garey, M.R.2    Johnson, D.S.3    Tarjan, R.E.4
  • 9
    • 0027558279 scopus 로고
    • Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms
    • E. G. Coffman and P. W. Shor, "Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms", Algorithmica, vol. 9, pp. 253-277, 1993.
    • (1993) Algorithmica , vol.9 , pp. 253-277
    • Coffman, E.G.1    Shor, P.W.2
  • 10
    • 24044472461 scopus 로고    scopus 로고
    • Multiple Translational Containment. Part I: An Approximation Algorithm
    • K. Daniels and V. J. Milenkovic, "Multiple Translational Containment. Part I: An Approximation Algorithm", Algorithmica, vol. 19, pp. 148-182, 1997
    • (1997) Algorithmica , vol.19 , pp. 148-182
    • Daniels, K.1    Milenkovic, V.J.2
  • 11
    • 0036605140 scopus 로고    scopus 로고
    • Two-Dimensional Packing Algorithms for Layout of Disconnected Graphs
    • U. Dogrusoz, "Two-Dimensional Packing Algorithms for Layout of Disconnected Graphs", Information Sciences, vol. 143, pp. 147-158, 2002.
    • (2002) Information Sciences , vol.143 , pp. 147-158
    • Dogrusoz, U.1
  • 12
    • 34547263396 scopus 로고    scopus 로고
    • Aesthetics and Automatic Layout of UML Class Diagrams
    • Ph.D. Thesis, Fakultät für Mathematik und Informatik, University of Würzburg, Germany
    • H. Eichelberger, "Aesthetics and Automatic Layout of UML Class Diagrams", Ph.D. Thesis, Fakultät für Mathematik und Informatik, University of Würzburg, Germany, 2005.
    • (2005)
    • Eichelberger, H.1
  • 14
    • 84867444225 scopus 로고    scopus 로고
    • Disconnected Graph Layout and the Polyomino Packing Approach
    • Proceedings of the 9th International Symposium on Graph Drawing GD'01, Springer, pp
    • K. Freivalds, U. Dogrusoz, and P. Kikusts, "Disconnected Graph Layout and the Polyomino Packing Approach", in Proceedings of the 9th International Symposium on Graph Drawing (GD'01), LNCS 2265, Springer, pp. 378-391, 2002.
    • (2002) LNCS , vol.2265 , pp. 378-391
    • Freivalds, K.1    Dogrusoz, U.2    Kikusts, P.3
  • 15
    • 0016534815 scopus 로고
    • Determining the Minimum-Area Encasing Rectangle for an Arbitrary Closed Curve
    • H. Freeman and R. Shapira, "Determining the Minimum-Area Encasing Rectangle for an Arbitrary Closed Curve", Communications of the ACM, vol. 18(7), pp. 409-413, 1975.
    • (1975) Communications of the ACM , vol.18 , Issue.7 , pp. 409-413
    • Freeman, H.1    Shapira, R.2
  • 17
    • 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. 7-15, 1989.
    • (1989) Information Processing Letters , vol.31 , pp. 7-15
    • Kamada, T.1    Kawai, S.2
  • 18
    • 4043183741 scopus 로고    scopus 로고
    • Drawing Graphs: Methods and Models
    • Springer, Berlin
    • M. Kaufmann and D. Wagner, "Drawing Graphs: Methods and Models", LNCS 2025, Springer, Berlin, 2001.
    • (2001) LNCS , vol.2025
    • Kaufmann, M.1    Wagner, D.2
  • 21
    • 77956545247 scopus 로고    scopus 로고
    • yFiles: Visualization and Automatic Layout of Graphs
    • Proceedings of the 9th International Symposium on Graph Drawing GD'01, Springer, pp
    • R. Wiese and M. Eiglsperger, and M. Kaufmann, "yFiles: Visualization and Automatic Layout of Graphs", in Proceedings of the 9th International Symposium on Graph Drawing (GD'01), LNCS 2265, Springer, pp. 453-454, 2002.
    • (2002) LNCS , vol.2265 , pp. 453-454
    • Wiese, R.1    Eiglsperger, M.2    Kaufmann, M.3


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