Kirszbraun extension on connected finite graph
classification
🧮 math.FA
keywords
extensionkirszbraunprovealgorithmcalculatescaseconnectedefficiently
read the original abstract
We prove that the tight function introduced Sheffield and Smart (2012) is a Kirszbraun extension. In the real-valued case we prove that Kirszbraun extension is unique. Moreover, we produce a simple algorithm which calculates efficiently the value of Kirszbraun extension in polynomial time.
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.