Designing heuristic algorithms for large semantic graphs : an exploration in approximating subgraph matches for imperfect fragments

dc.rights.license	Restricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Research Libraries.
dc.contributor	Goldberg, Mark
dc.contributor.author	Greenman, Joshua
dc.date.accessioned	2021-11-03T10:04:45Z
dc.date.available	2021-11-03T10:04:45Z
dc.date.created	2011-01-18T10:11:59Z
dc.date.issued	2010-12
dc.identifier.uri	https://hdl.handle.net/20.500.13015/3131
dc.description	December 2010
dc.description	School of Science
dc.description	Social Cognitive Networks Academic Research Center
dc.language.iso	ENG
dc.publisher	Rensselaer Polytechnic Institute, Troy, NY
dc.relation.ispartof	Rensselaer Theses and Dissertations Online Collection
dc.subject	Computer science
dc.title	Designing heuristic algorithms for large semantic graphs : an exploration in approximating subgraph matches for imperfect fragments
dc.type	Electronic thesis
dc.type	Thesis
dc.digitool.pid	26617
dc.digitool.pid	26618
dc.digitool.pid	26620
dc.digitool.pid	26619
dc.digitool.pid	26621
dc.rights.holder	This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
dc.description.degree	MS
dc.relation.department	Dept. of Computer Science

RPI Theses Online (Complete)
Rensselaer theses from 2006; many restricted to current RPI Students, Faculty and Staff