A necessary and sufficient condition for acyclic graphs
| Data(s) |
01/02/1985
|
|---|---|
| Resumo |
This letter gives a new necessary and sufficient condition to determine whether a directed graph is acyclic. |
| Formato |
application/pdf |
| Identificador |
http://eprints.iisc.ernet.in/22041/1/30.pdf Ravi, R (1985) A necessary and sufficient condition for acyclic graphs. In: Proceedings of the IEEE, 73 (2). 369 -370. |
| Publicador |
IEEE |
| Relação |
http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=1457415&isnumber=31346&punumber=5&k2dockey=1457415@ieeejrns&query=1457415%3Cin%3Earnumber&pos=0 http://eprints.iisc.ernet.in/22041/ |
| Palavras-Chave | #Computer Science & Automation (Formerly, School of Automation) |
| Tipo |
Journal Article PeerReviewed |
