By Topic

A node marking algorithm for partitioning wireless mesh networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Pandey, S. ; Dept. of Inf. Sci. & Eng., CMR Inst. of Technol., Bangalore, India ; Pande, V.

The usual search and traversal methods, like depth first search of graphs and the breadth first search of graphs, are based on marking the vertices as discovered, or visited, to avoid repetitions. This paper proposes a simple yet efficient and very low time complexity algorithm based on adjacency matrix to mark visited / selected vertices for a simple dense graph. This adjacency matrix based method is especially useful in relabeling of adjacency matrix for creating graph partitions. Relabeling is carried out to collect neighboring nodes and form a partition. This algorithm is generic and can be used for any adjacency matrix based graph search.

Published in:

Open Systems (ICOS), 2011 IEEE Conference on

Date of Conference:

25-28 Sept. 2011