Graph connectivity and its augmentation: applications of MA orderings Original Research Article

This paper surveys how the maximum adjacency (MA) ordering of the vertices in a graph can be used to solve various graph problems. We first explain that the minimum cut problem can be solved efficiently by utilizing the MA ordering. The idea is then extended to a fundamental operation of a graph, edge splitting. Based on this, the edge-connectivity augmentation problem for a given k (and also for the entire range of k) can be solved efficiently by making use of the MA ordering, where it is asked to add the smallest number of new edges to a given graph so that its edge-connectivity is increased to k. Other related topics are also surveyed.