2009; Physical and Mathematical Sciences, 43(2 (219): 43–49
Shared with The Gufo

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

A. H. Khachaturyan*

Received: 2025-02-28 · Published: 2009-06-26

© 2009 The Author(s) and the original publisher.

CC BY 4.0 This work is licensed under a Creative Commons Attribution 4.0 International License.
Shared article.
Original title
OPTIMAL LEVEL PLACEMENT OF THE TRANSITIVE ORIENTED AND BIPARTITE ORIENTED GRAPHS BY HEIGHT
Author
A. H. Khachaturyan
Published
2009-06-26
Licence
Creative Commons Attribution 4.0 International

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.
1 / ? 100% Open in new tab Download Cite

Loading the full text…

Download Follow Updates