OPTIMAL LEVEL PLACEMENT OF THE TRANSITIVE ORIENTED AND BIPARTITE ORIENTED GRAPHS BY HEIGHT

Author(s)

OPTIMAL LEVEL PLACEMENT OF THE TRANSITIVE ORIENTED AND BIPARTITE ORIENTED GRAPHS BY HEIGHT A. H. Khachaturyan

In this work we discuss level placement (numeration, arrangement) by height optimal algorithms for transitive oriented and bipartite oriented graphs. There are described three definitions of the oriented graph, and for those three definitions it is solved the level placement problem for transitive oriented graph. The problem of level placement of bipartite oriented graph is solved by the linear complexity algorithm, whereas the problems of level placement of transitive oriented graph are solved by the quadratic complexity algorithms.

DOI: 10.46991/PYSUA.2009.43.2.043 Physical and Mathematical Sciences, 43(2 (219) 43-49

Download PDF

Keywords

transitive oriented graph, level placement

Check for updates

Share

Contact admin with any questions, comments or concerns

[email protected]