Series Parallel Linkages
classification
🧮 math.GT
keywords
graphlinkagesparallelseriesspacesalgorithmconnecteddescribe
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.