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


We present an algorithm which returns a shortest path and related number of entanglements for a given configuration of a polymeric system in 2 or 3 dimensions. Rubinstein and Helfand, and later Everaers et al. introduced a concept to extract primitive paths for dense polymeric melts made of linear chains (a multiple disconnected multibead ‘path’), where… (More)
DOI: 10.1016/j.cpc.2005.01.020


15 Figures and Tables