# Correctness of algorithm and its complexity

I am trying to solve problem of generation of so called activity-on-edge (activity-on-arc) network graph given based on given activity-on-node network graph.

So, I found this paper proposing an algorithm solving the problem, but I don't really understand the example given on pages 5-6, namely the partition of the graph into complete bipartite subgraph presented on page 6. Also I don't see difference between figures 11b and 11c - it looks that they must differ.

Could anyone explain how authors came to the solution and is it correct?

Paper citation: Mouhoub, Nasser & Benhocine, Abdelhamid. (2012). An efficient algorithm for generating AoA networks. International Journal of Computer Science Issues. 9.