ON A RECURSIVE APPROACH TO THE SOLUTION OF MINLA PROBLEM

Hovhannes Sargsyan

Received N/A; revised N/A; accepted N/A

This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

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.

Author(s)

Related Articles

ON UNIQUENESS OF HOLOMORPHIC AND BOUNDED OUTSIDE THE CLOSED LOGARITHMIC SECTOR FUNCTIONS REPRESENTABLE BY LACUNARY POWER SERIES

COMPUTER DETECTING AND PROCESSING OF THE SIGNALS OF A FLAT-COIL ABSOLUTE-POSITION SENSOR BASED SEISMIC DETECTOR

ON q-LATTICES AND q-ALGEBRAS

ON INCREASING HAZARD RATE OF WAITING TIME IN THE ||1|∞MG MODEL

ON DISTRIBUTION’S CONSTANT SLOWLY VARYING COMPONENT

ON A RECURSIVE APPROACH TO THE SOLUTION OF MINLA PROBLEM

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter