A minmax relationship between embeddable and rigid graphs

Applied Mathematics Letters

Saved in:

Bibliographic Details
Main Authors:	Tay, T.S., Nievergelt, J.
Other Authors:	MATHEMATICS
Format:	Article
Published:	2014
Subjects:	Elastic embedding Generic rigidity Weighted graphs
Online Access:	http://scholarbank.nus.edu.sg/handle/10635/102679
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	National University of Singapore

id	sg-nus-scholar.10635-102679
record_format	dspace
spelling	sg-nus-scholar.10635-1026792015-01-31T13:22:52Z A minmax relationship between embeddable and rigid graphs Tay, T.S. Nievergelt, J. MATHEMATICS Elastic embedding Generic rigidity Weighted graphs Applied Mathematics Letters 10 4 71-76 AMLEE 2014-10-28T02:28:27Z 2014-10-28T02:28:27Z 1997-07 Article Tay, T.S.,Nievergelt, J. (1997-07). A minmax relationship between embeddable and rigid graphs. Applied Mathematics Letters 10 (4) : 71-76. ScholarBank@NUS Repository. 08939659 http://scholarbank.nus.edu.sg/handle/10635/102679 NOT_IN_WOS Scopus
institution	National University of Singapore
building	NUS Library
country	Singapore
collection	ScholarBank@NUS
topic	Elastic embedding Generic rigidity Weighted graphs
spellingShingle	Elastic embedding Generic rigidity Weighted graphs Tay, T.S. Nievergelt, J. A minmax relationship between embeddable and rigid graphs
description	Applied Mathematics Letters
author2	MATHEMATICS
author_facet	MATHEMATICS Tay, T.S. Nievergelt, J.
format	Article
author	Tay, T.S. Nievergelt, J.
author_sort	Tay, T.S.
title	A minmax relationship between embeddable and rigid graphs
title_short	A minmax relationship between embeddable and rigid graphs
title_full	A minmax relationship between embeddable and rigid graphs
title_fullStr	A minmax relationship between embeddable and rigid graphs
title_full_unstemmed	A minmax relationship between embeddable and rigid graphs
title_sort	minmax relationship between embeddable and rigid graphs
publishDate	2014
url	http://scholarbank.nus.edu.sg/handle/10635/102679
_version_	1681092781579173888

A minmax relationship between embeddable and rigid graphs

Similar Items