Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
This talk by Torin Greenwood from North Dakota State University explores the mathematical concept that the ends of a branched structure must be close to each other. Delivered at the International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2025) at the Fields Institute on May 7, 2025, the presentation delves into fundamental properties of branching structures and their spatial relationships. Learn about the mathematical principles that govern how terminal points in branched networks relate to one another, with applications potentially relevant to algorithm analysis, network theory, and combinatorial mathematics.
