ON A RECURSIVE APPROACH TO THE SOLUTION OF MINLA PROBLEM

H.E. Sargsyan

doi:10.46991/PSYU:A/2014.48.1.048

ON A RECURSIVE APPROACH TO THE SOLUTION OF MINLA PROBLEM

Authors

H.E. Sargsyan Chair of Discrete Mathematics and Theoretical Informatics, YSU, Armenia

DOI:

https://doi.org/10.46991/PSYU:A/2014.48.1.048

Keywords:

MINLA, graph linear arrangement, G-oriented graphs

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, G-oriented graphs.

Downloads

Published

2014-04-10

How to Cite

Sargsyan, H. (2014). ON A RECURSIVE APPROACH TO THE SOLUTION OF MINLA PROBLEM. Proceedings of the YSU A: Physical and Mathematical Sciences, 48(1 (233), 48–50. https://doi.org/10.46991/PSYU:A/2014.48.1.048