Kirszbraun extension on connected finite graph
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.