Title of article
Extended Connectivity in Directed Graphs
Author/Authors
Jure Zupan and others، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
5
From page
604
To page
608
Abstract
An algorithm for the evaluation of the extended connectivity in directed graphs is described and discussed. The algorithm is a general purpose one for finding the number of all paths from any given node Vi in a directed graph toward all leaves that can be reached from that particular node Vi in the graph.
Keywords
Directed graphs , algorithm , large data base , Extended connectivity
Journal title
Acta Chimica Slovenica
Serial Year
2010
Journal title
Acta Chimica Slovenica
Record number
672273
Link To Document