2014; Physical and Mathematical Sciences, 48(1 (233): 48–50
Shared with The Gufo

ON A RECURSIVE APPROACH TO THE SOLUTION OF MINLA PROBLEM

Hovhannes Sargsyan*

Received: 2025-02-17 · Published: 2014-04-10

© 2014 The Author(s) and the original publisher.

CC BY 4.0 This work is licensed under a Creative Commons Attribution 4.0 International License.
Shared article.
Original title
ON A RECURSIVE APPROACH TO THE SOLUTION OF MINLA PROBLEM
Author
Hovhannes Sargsyan
Published
2014-04-10
Licence
Creative Commons Attribution 4.0 International
Original
https://doi.org/10.46991/PYSUA.2014.48.1.048

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.
1 / ? 100% Open in new tab Download Cite

Loading the full text…

Download Follow Updates