Year: 2009
Type: preprint
Abstract: We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected.
Source: arXiv (Cornell University)
Authors: Cruickshank, James, McLaughlin, Jonathan
Institution: National University of Ireland
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2950844149
