Testing Euclidean minimum spanning trees in the plane
Czumaj, A. and Sohler, C. (2008) Testing Euclidean minimum spanning trees in the plane. ACM Transactions on Algorithms (TALG), 4 (3).
![[img]](http://eprints.dcs.warwick.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
Restricted to Repository staff only Download (228Kb) |
Official URL: http://dx.doi.org/10.1145/1367064.1367071
Abstract
Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in more than ε n edges. We assume that G is given in adjacency list representation and the point/vertex set P is given in an array. We present a property testing algorithm that accepts graph G if it is an EMST of P and that rejects with probability at least 2/3 if G differs from every EMST of P in more than ε, n edges. Our algorithm runs in O(&sqrt;n/ε ⋅ log2 (n/ε)) time and has a query complexity of O(&sqrt;n/ε ⋅ log (n/ε)).
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | focs euclidean minimum spanning tree |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Faculty of Science > Computer Science |
| Depositing User: | Ms Saima Arif |
| Date Deposited: | 07 Jan 2011 12:10 |
| Last Modified: | 26 Jul 2011 11:15 |
| URI: | http://eprints.dcs.warwick.ac.uk/id/eprint/588 |
Actions (login required)
 |
View Item |
