Graph Threading
Abstract: Inspired by artistic practices such as beadwork and himmeli, we study the problem of threading a single string through a set of tubes, so that pulling the string forms a desired graph. More precisely, given a connected graph (where edges represent tubes and vertices represent junctions where they meet), we give a polynomial-time algorithm to find a minimum-length closed walk (representing a threading of string) that induces a connected graph of string at every junction. The algorithm is based on a surprising reduction to minimum-weight perfect matching. Along the way, we give tight worst-case bounds on the length of the optimal threading and on the maximum number of times this threading can visit a single edge. We also give more efficient solutions to two special cases: cubic graphs and the case when each edge can be visited at most twice.
- Efficient algorithms for Petersen’s matching theorem. Journal of Algorithms, 38(1):110–134, 2001.
- Edge matching with inequalities, triangles, unknown shape, and two players. Journal of Information Processing, 28:987–1007, 2020.
- J. A. (John Adrian) Bondy. Graph Theory with Applications. North Holland, New York, 1980–1976.
- Carina Chela. The original Finnish Christmas ornament. this is FINLAND, Dec 2013.
- Arboricity and subgraph listing algorithms. SIAM Journal on Computing, 14(1):210–223, 1985.
- Perfect matchings in planar cubic graphs. Combinatorica, 32(4):403–424, 2012.
- D. de Caen. An upper bound on the sum of squares of degrees in a graph. Discrete Mathematics, 185(1):245–248, 1998.
- Alfred Errera. Du colorage des cartes. Mathesis, 36:56–60, 1922.
- Herbert Fleischner. Eulerian graphs and related topics. North-Holland, Amsterdam, 1990.
- An O(EVlogV)𝑂𝐸𝑉𝑉O(EV\log V)italic_O ( italic_E italic_V roman_log italic_V ) algorithm for finding a maximal weighted matching in general graphs. SIAM J. Comput., 15:120–130, Feb 1986.
- James Green. Beadwork in the arts of Africa and beyond. The Metropolitan Museum of Art, Jul 2018.
- Beady: Interactive beadwork design and construction. ACM Trans. Graph., 31(4), Jul 2012.
- Joelle Jackson. Heavenly harmony: The universal language of Finnish himmeli. Smithsonian Center for Folklife and Cultural Heritage, Jul 2021.
- Bead sculptures and bead-chain interlocking puzzles inspired by molecules and nanoscale structure. 2019.
- Alison Martin. Optimization of threading paths. Twitter, Nov 2021.
- An O(|v|⋅|E|)𝑂⋅𝑣𝐸O(\sqrt{|v|}\cdot|E|)italic_O ( square-root start_ARG | italic_v | end_ARG ⋅ | italic_E | ) algoithm for finding maximum matching in general graphs. In 21st Annual Symposium on Foundations of Computer Science (sfcs 1980), pages 17–27, 1980.
- Rodakis. Push puppet.
- Saskia Solomon. A vanishing craft reappears. The New York Times, Sep 2022.
- Wikipedia. Straw mobile, Apr 2023.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.