In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...
Abstract—This paper develops an efficient distributed algorithm for localising motes in a large scale sensor network using radio interferometric positioning. The focus here is on...
Marcus Brazil, Mark R. Morelande, Bill Moran, D. A...
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Ageometric framework for the recognition of three-dimensional objects represented by point
clouds is introducedin this paper. The proposed approach is based on comparing distribut...