ON A RECURSIVE APPROACH TO THE SOLUTION OF MINLA PROBLEM
DOI:
https://doi.org/10.46991/PSYU:A/2014.48.1.048Keywords:
MINLA, graph linear arrangement, G-oriented graphsAbstract
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
Issue
Section
Informatics
License
Copyright (c) 2014 Proceedings of the YSU
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.