the topological ordering of covering nodes
|
|
|
|
|
|
|
|
نویسنده
|
shirdel gholam hassan ,kahkeshani nasrin
|
|
منبع
|
communications in combinatorics and optimization - 2020 - دوره : 5 - شماره : 1 - صفحه:55 -60
|
|
چکیده
|
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 containing the covering nodes. we show that there exists a cut set with forward arcs in these graphs and the order of the covering nodes is successive.
|
|
کلیدواژه
|
directed graph ,covering nodes ,topological ordering algorithm
|
|
آدرس
|
university of qom, iran, university of qom, iran
|
|
پست الکترونیکی
|
nasrinkahkeshani@gmail.com
|
|
|
|
|
|
|