Identifying Nœuds de Liaison in Networks

Abstract We defined and developed a computational procedure for finding theintermediary nodes in networks we named Nœuds de liaison. A nœud deliaison refers to any cut-vertex v of a graph G but is not a member of anypseudo-clique Qi, ∀ Qi ⊆ G . The pseudo-clique Q is made up of nodesin G that are closely connected to each other, and where the nodes format least a ring C and at most a complete graph K . The computationalprocedure took O(V+E) to print out all the nœuds de liaison. Our majorfinding is that we designed a linear time algorithm and wrote a computerprogram for computing all the nœuds de liaison in undirected graphs.