Recognizing and Embedding Outerplanar Distributed Computer Networks

Author

Tsin, Yung H.

Author_Institution

Sch. of Comput. Sci., Univ. of Windsor, Windsor, ON, Canada

fYear

2011

fDate

10-12 Oct. 2011

Firstpage

212

Lastpage

219

Abstract

A new distributed algorithm for outerplanar network recognition and embedding is presented. The algorithm requires 2n-2 time and transmits at most 5m messages of O(lg n) length, where m is the number of links and n is the number of nodes in the network. In addition, if the network is indeed outerplanar, the algorithm will run in 2n-2 time and transmit at most 10n-15 messages. This time bound is the best one could ever achieve with a depth-first-search based algorithm. The previously best known algorithm achieves O(n) time and message bounds by using messages of O(n) length and running on a stronger model, making multiple passes over the network.

Keywords

communication complexity; computer networks; distributed algorithms; message passing; tree searching; 2n-2 time; depth-first-search based algorithm; distributed algorithm; message bounds; outerplanar distributed computer networks; outerplanar network embedding; outerplanar network recognition; time bound; Distributed algorithms; Educational institutions; Face; Knowledge engineering; Receivers; Routing; Testing; distributed algorithm; graph algorithm; network recognition algorithm; outerplanar network; outerplanarity;

fLanguage

English

Publisher

ieee

Conference_Titel

Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), 2011 International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4577-1827-4

Type

conf

DOI

10.1109/CyberC.2011.43

Filename

6079383