|
Proceedings of the Yerevan State University, series Physical and Mathematical Sciences, 2014, Issue 1, Pages 48–50
(Mi uzeru50)
|
|
|
|
Informatics
On a recursive approach to the solution of MINLA problem
H. E. Sargsyan Improvis LLC
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, $\Gamma$ graphs.
Keywords:
MINLA, graph linear arrangement, $\Gamma$-oriented graphs.
Received: 13.02.2014 Accepted: 20.02.2014
Citation:
H. E. Sargsyan, “On a recursive approach to the solution of MINLA problem”, Proceedings of the YSU, Physical and Mathematical Sciences, 2014, no. 1, 48–50
Linking options:
https://www.mathnet.ru/eng/uzeru50 https://www.mathnet.ru/eng/uzeru/y2014/i1/p48
|
Statistics & downloads: |
Abstract page: | 67 | Full-text PDF : | 21 | References: | 40 |
|