The topological ordering of covering nodes
Authors
Abstract:
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 orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these graphs and the order of the covering nodes is successive.
similar resources
THE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
full textTopological Games and Covering Dimension
We consider a natural way of extending the Lebesgue covering dimension to various classes of infinite dimensional separable metric spaces. All spaces in this paper are assumed to be separable metric spaces. Infinite games can be used in a natural way to define ordinal valued functions on the class of separable metric spaces. One of our examples of such an ordinal function coincides in any finit...
full textOrdering of cosmid clones covering the Herpes simplex virus
To allow the efficient construction of ordered clone libraries, we have been investigating the use of 'oligonucleotide fingerprinting' as an approach to identify overlapping clones, and ultimately restore the linear order of the clone set. To test the effectiveness of the procedure, we have constructed a cosmid library from the genome of the human DNA virus HSV-1 and used hybridisation to multi...
full textCovering Salesman Problem with Nodes and Segments
In the Covering Salesman Problem (CSP), a distribution of nodes is provided, and the objective is to identify the shortest-length tour of a subset of all given nodes such that each node is not on the tour which is within a radius r of any node on the tour. In this paper, we define a new covering problem called the CSP with Nodes and Segments (CSPNS). The main difference between the CSP and the ...
full textTopological structure of covering rough sets
In this study, we induce some topological structures in the covering rough set models, and construct their closure operators by using the covering upper approximation operators. Furthermore, we show that the minimum set of each of these topological structures is their base, and a partition on the universe of discourse. Finally, we discuss the relationships between some topologies generated by s...
full textSome Topological Properties of Ω-covering Sets
We prove the following theorems: 1. There exists an ω-covering with the property s0. 2. Under cov(N ) = 2 there exists X such that ∀B∈Bor[B ∩ X is not an ω-covering or X \B is not an ω-covering]. 3. Also we characterize the property of being an ω-covering.
full textMy Resources
Journal title
volume 5 issue 1
pages 55- 60
publication date 2020-06-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023