MINIMUM LINEAR ARRANGEMENT OF THE TRANSITIVE ORIENTED, BIPARTITE GRAPHS

H.E. Sargsyan

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

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

Abstract

We study the minimum linear arrangement of the graphs (MINLA) on transitive oriented graphs. We prove that MINLA of transitive oriented graphs is NP-complete.

Author(s)

Table of Contents

MINIMUM LINEAR ARRANGEMENT OF THE TRANSITIVE ORIENTED, BIPARTITE GRAPHS

Abstract

Author(s)

Table of Contents

Related Articles

AZIMUTHS RADIATION RISK DEGREE APPRAISAL FOR THE POPULATION LIVING IN AREA OF THE NUCLEAR POWER PLANTS LOCATION

THE KINETICS OF VESICLES SWELLING IN PRESENCE OF TRANSMEMBRANE DIFFERENCE OF POTENTIALS

MINIMUM LINEAR ARRANGEMENT OF THE TRANSITIVE ORIENTED, BIPARTITE GRAPHS

Abstract

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter