Topological sorts on DAGs
No Thumbnail Available
File version
Author(s)
Pang, Chaoyi
Wang, Junhu
Cheng, Yu
Zhang, Haolan
Li, Tongliang
Wang, Junhu
Cheng, Yu
Zhang, Haolan
Li, Tongliang
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2015
Size
File type(s)
Location
License
Abstract
In this article, we will study the topological sorts of two directed acyclic graphs (DAGs) and the associated properties. More specifically, we will study under what conditions a certain single (or some, or every) topological sort(s) of a DAG can be extended into the topological sort(s) of another DAG. We first give the necessary and sufficient conditions for the problems. We then indicate that these problems are solvable either in linear time cost or in the same time cost as to compute the transitive closure.
Journal Title
Information Processing Letters
Conference Title
Book Title
Edition
Volume
115
Issue
2
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Mathematical sciences
Information and computing sciences
Database systems
Engineering