MINIMUM LINEAR ARRANGEMENT OF THE TRANSITIVE ORIENTED, BIPARTITE GRAPHS

H.E. 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).

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)

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

MEASUREMENT OF A PHASE POSITION OF ELECTRON BUNCHES

MINIMUM LINEAR ARRANGEMENT OF THE TRANSITIVE ORIENTED, BIPARTITE GRAPHS

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter