Mixed Volume Techniques for Embeddings of Laman Graphs Reinhard Steffens∗, Thorsten Theobald† Abstract We use Bernstein’s Theorem [1] to obtain combinatorial bounds for the - Topological graph - Document - PDFSEARCH.IO

First Page	Meta Content
	Mixed Volume Techniques for Embeddings of Laman Graphs Reinhard Steffens∗, Thorsten Theobald† Abstract We use Bernstein’s Theorem [1] to obtain combinatorial bounds for the Add to Reading List Document Date: 2008-06-23 09:41:53 Open Document File Size: 194,33 KB Share Result on Facebook

Mixed Volume Techniques for Embeddings of Laman Graphs Reinhard Steffens∗, Thorsten Theobald† Abstract We use Bernstein’s Theorem [1] to obtain combinatorial bounds for theAdd to Reading List