Ravi, R (1985) A necessary and sufficient condition for acyclic graphs. In: Proceedings of the IEEE, 73 (2). 369 -370.
30.pdf - Published Version
Restricted to Registered users only
Download (174Kb) | Request a copy
This letter gives a new necessary and sufficient condition to determine whether a directed graph is acyclic.
|Item Type:||Journal Article|
|Additional Information:||Copyright 1985 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||27 Nov 2009 09:47|
|Last Modified:||19 Sep 2010 05:40|
Actions (login required)