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

Authors

  • S. E. Markosyan Chair of Discrete Mathematics and Theoretical Informatics, YSU, Armenia
  • A. H. Khachaturyan Chair of Discrete Mathematics and Theoretical Informatics, YSU, Armenia

DOI:

https://doi.org/10.46991/PYSU:A/2009.43.2.043

Keywords:

transitive oriented graph, level placement

Abstract

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.

Downloads

Published

2009-06-26

How to Cite

Markosyan, S. E., & Khachaturyan, A. H. (2009). OPTIMAL LEVEL PLACEMENT OF THE TRANSITIVE ORIENTED AND BIPARTITE ORIENTED GRAPHS BY HEIGHT. Proceedings of the YSU A: Physical and Mathematical Sciences, 43(2 (219), 43–49. https://doi.org/10.46991/PYSU:A/2009.43.2.043

Issue

Section

Informatics