ON A RECURSIVE APPROACH TO THE SOLUTION OF MINLA PROBLEM

Author(s)

ON A RECURSIVE APPROACH TO THE SOLUTION OF MINLA PROBLEM Hovhannes Sargsyan

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.

DOI: 10.46991/PYSUA.2014.48.1.048 Physical and Mathematical Sciences, 48(1 (233) 48-50

Download PDF

Keywords

MINLA, graph linear arrangement, G-oriented graphs

Check for updates

Share

Contact admin with any questions, comments or concerns

[email protected]