Kirszbraun extension on connected finite graph
Functional Analysis
2015-11-06 v1
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.
Cite
@article{arxiv.1511.01748,
title = {Kirszbraun extension on connected finite graph},
author = {Erwan Le Gruyer and Thanh Viet Phan},
journal= {arXiv preprint arXiv:1511.01748},
year = {2015}
}