메뉴 건너뛰기




Volumn 168, Issue 3, 2005, Pages 209-232

Shortest multiple disconnected path for the analysis of entanglements in two- and three-dimensional polymeric systems

Author keywords

Algorithm; Concentration; Configuration; Critical molecular weight; Edges; Entanglement; Line segments; Multiple disconnected path; Nodes; Obstacles; Polymer; Primitive path; Scaling behavior

Indexed keywords

ALGORITHMS; ANISOTROPY; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; MOLECULAR DYNAMICS; OPTIMIZATION;

EID: 19044388149     PISSN: 00104655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cpc.2005.01.020     Document Type: Article
Times cited : (436)

References (63)
  • 3
    • 0002008783 scopus 로고    scopus 로고
    • Geometric shortest paths and network optimization
    • J.-R. Sack J. Urrutia Elsevier Amsterdam
    • J.S.B. Mitchell Geometric shortest paths and network optimization J.-R. Sack J. Urrutia Handbook of Computational Geometry 2000 Elsevier Amsterdam 633 701
    • (2000) Handbook of Computational Geometry , pp. 633-701
    • Mitchell, J.S.B.1
  • 7
    • 84957666373 scopus 로고    scopus 로고
    • An o-approximation algorithm for weighted shortest paths on polyhedral surfaces
    • Proc. 6th Scand. Workshop Algorithm Theory Springer New York
    • L. Alexandrov, M. Lanthier, A. Maheshwari, and J.-R. Sack An o-approximation algorithm for weighted shortest paths on polyhedral surfaces Proc. 6th Scand. Workshop Algorithm Theory Lecture Notes Comput. Sci. vol. 1432 1998 Springer New York
    • (1998) Lecture Notes Comput. Sci. , vol.1432
    • Alexandrov, L.1    Lanthier, M.2    Maheshwari, A.3    Sack, J.-R.4
  • 8
    • 0003223423 scopus 로고
    • Lectures on Spaces of Nonpositive Curvature
    • Birkhäuser Basel, Boston, Berlin
    • W. Ballmann Lectures on Spaces of Nonpositive Curvature DMV Seminar vol. 25 1995 Birkhäuser Basel, Boston, Berlin
    • (1995) DMV Seminar , vol.25
    • Ballmann, W.1
  • 9
    • 0001489441 scopus 로고
    • Multidimensional generalized Riemann spaces
    • Yu. Reshetnyak Geometry 4. Non-Regular Riemann Geometry Springer Berlin
    • V. Berestovsij, and I. Nikolaev Multidimensional generalized Riemann spaces Yu. Reshetnyak Geometry 4. Non-Regular Riemann Geometry Encyclopedia Math. Sci. vol. 70 1993 Springer Berlin
    • (1993) Encyclopedia Math. Sci. , vol.70
    • Berestovsij, V.1    Nikolaev, I.2
  • 14
    • 0032514314 scopus 로고    scopus 로고
    • Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane
    • ACM Press New York
    • D. Grigoriev, and A. Slissenko Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane Proc. 1998 Int. Symp. on Symbolic and Algebraic Computations (ISSAC-98) 1998 ACM Press New York 17 24
    • (1998) Proc. 1998 Int. Symp. on Symbolic and Algebraic Computations (ISSAC-98) , pp. 17-24
    • Grigoriev, D.1    Slissenko, A.2
  • 34
    • 0004036594 scopus 로고    scopus 로고
    • Monte Carlo and Molecular Dynamics of Condensed Matter Systems
    • Societá Italiana di Fisica Bologna
    • K. Binder G. Ciccotti Monte Carlo and Molecular Dynamics of Condensed Matter Systems IPS Conf. Proc. vol. 49 1996 Societá Italiana di Fisica Bologna
    • (1996) IPS Conf. Proc. , vol.49
    • Binder, K.1    Ciccotti, G.2
  • 36
    • 0009389028 scopus 로고
    • Computer Simulation in Chemical Physics
    • M.P. Allen D.J. Tildesley
    • K. Kremer M.P. Allen D.J. Tildesley Computer Simulation in Chemical Physics NATO ASI C vol. 397 1993
    • (1993) NATO ASI C , vol.397
    • Kremer, K.1
  • 63
    • 18144415837 scopus 로고    scopus 로고
    • The chain retraction potential in a fixed entanglement network
    • S. Shanbhag, and R.G. Larson The chain retraction potential in a fixed entanglement network Phys. Rev. Lett. 94 2005 076001
    • (2005) Phys. Rev. Lett. , vol.94 , pp. 076001
    • Shanbhag, S.1    Larson, R.G.2


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