Counting for rigidity, flexibility and extensions via the pebble game algorithm /

Description

Thesis (M.Sc.)--York University, 2006. Graduate Programme in Mathematics and Statistics. / Typescript. Includes bibliographical references (leaves 168-173). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR19755

Links & Downloads

1. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR19755

Tags

Algorithms Graph algorithms

Additional Fields

Identifer	oai:union.ndltd.org:OCLC/oai:xtcat.oclc.org:OCLCNo/225986283
Date	January 2006
Creators	Sljoka, Adnan.
Source Sets	OCLC
Language	English
Detected Language	English