On a recursive approach to the solution of MINLA problem (MINLA խնդրի լուծման մի ռեկուրսիվ մոտեցման մասին)

Abstract

In this paper a recursive approach is suggested for the problem of Minimum Linear Arrangement (MINLA) of a graph by length. A minimality criterion of an arrangement is presented, from which a simple proof is obtained for the polynomial solvability of the problem in the class of bipartite, Γ-oriented graphs.