Work

DFID Time Complexity in Mobile Network

Year: 2018

Type: article

Abstract: Hexagonal network structures the base for mobile communication networks. To increase the efficiency of mobile communication, we implement the DFID algorithm for transmission. Let DFID denote the time taken by DFS and BFS preorder traversing to find the vertex x in graph DFID(x,G). In this section we discuss DFS and BFS for G beign a hexagonal mesh of dimension n i.e HXn..Thereby computing the time complexity of DFID algorithm for mobile networking.

Source: International Journal of Computer Sciences and Engineering

DOI: 10.26438/ijcse/v6i2.9297

Authors: Justin Sophia. I, N. Rama

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W2808699604

FWCI:

Cites: 8

Cited by:

Related to: 10