The topological ordering of covering nodes
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological ordering algorithm on graphs con...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Azarbaijan Shahide Madani University
2020-06-01
|
| Series: | Communications in Combinatorics and Optimization |
| Subjects: | |
| Online Access: | http://comb-opt.azaruniv.ac.ir/article_13958_bb278a35f5e754d8fa7152e537a20961.pdf |