Embedding of Rigid Graphs in Grids

dc.contributor.author	Jaxing, Jesper
dc.contributor.author	Goretskyy, Maxim
dc.contributor.department	Chalmers tekniska högskola / Institutionen för data och informationsteknik	sv
dc.contributor.examiner	Kemp, Graham
dc.contributor.supervisor	Damaschke, Peter
dc.date.accessioned	2019-07-11T07:56:13Z
dc.date.available	2019-07-11T07:56:13Z
dc.date.issued	2019	sv
dc.date.submitted	2019
dc.description.abstract	This thesis concerns the problem of finding a unit embedding of a graph in a square grid. We introduce the concept of a rigid graph, which is a graph with a unique unit embedding. We present a few polynomial algorithms for embedding large rigid subgraphs of an arbitrary graph.	sv
dc.identifier.coursecode	DATX05	sv
dc.identifier.uri	https://hdl.handle.net/20.500.12380/300045
dc.language.iso	eng	sv
dc.setspec.uppsok	Technology
dc.subject	Computer	sv
dc.subject	science	sv
dc.subject	factory layout	sv
dc.subject	grid embedding	sv
dc.subject	unit embedding	sv
dc.subject	graph	sv
dc.subject	theory	sv
dc.subject	rigid	sv
dc.subject	graphs	sv
dc.subject	grid	sv
dc.title	Embedding of Rigid Graphs in Grids	sv
dc.type.degree	Examensarbete för masterexamen	sv
dc.type.uppsok	H

Download

Now showing 1 - 1 of 1

Now showing 1 - 1 of 1