A Polynomial Time Algorithm for Reconfiguring Multiple-Track Models

Varvarigou, T; Roychowdhury, V; Kailath, T

dc.contributor.author	Varvarigou, T	en
dc.contributor.author	Roychowdhury, V	en
dc.contributor.author	Kailath, T	en
dc.date.accessioned	2014-03-01T01:41:34Z
dc.date.available	2014-03-01T01:41:34Z
dc.date.issued	1993	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/23531
dc.subject	Combinatorial Problems	en
dc.subject	Fault Tolerant	en
dc.subject	Indexing Terms	en
dc.subject	Polynomial Time Algorithm	en
dc.subject	Time Complexity	en
dc.title	A Polynomial Time Algorithm for Reconfiguring Multiple-Track Models	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/12.214686	en
heal.identifier.secondary	http://dx.doi.org/10.1109/12.214686	en
heal.publicationDate	1993	en
heal.abstract	A polynomial time algorithm for solving the combinatorial problem that underlies the reconfiguration issues in the m1/2-track-m-spare model, for any arbitrary m, is discussed. The following combinatorial problem is solved: Given a set of points in a two-dimensional grid, find a set of noninteracting straight lines such that every line starts at a point and connects to one of the	en
heal.journalName	IEEE Transactions on Computers	en
dc.identifier.doi	10.1109/12.214686	en