A Degree-First Greedy Search Algorithm for the Evaluation of Structural Controllability of Real World Directed Complex Networks

Ubiquitous data flow through a directed complex network requires the complete structural controllability of the network. For evaluating the structural controllability of any network, determination of maximum matching in the network is a cardinal task and has always been a problem of immense concern. Its solution is mandatory in structural control theory for controlling real world complex networks. The existing classical approach through the Hopcroft-Karp algorithm and other proposed algorithms require the determination of the bipartite equivalent graph (i.e., network), which belongs to the NP-complete class of problems.

Provided by: Macrothink Institute Topic: Networking Date Added: Apr 2014 Format: PDF

Find By Topic