Free Delivery Over $100
|
|
|||
|
||||
OverviewPlease note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. High Quality Content by WIKIPEDIA articles! In graph theory, reachability is the notion of being able to get from one vertex in a directed graph to some other vertex. Note that reachability in undirected graphs is trivial--it is sufficient to find the connected components in the graph, which can be done in linear time.For a directed graph D = (V, A), the reachability relation of D is the transitive closure of its arc set A, which is to say the set of all ordered pairs (s, t) of vertices in V for which there exist vertices v0 = s, v1, ..., vd = t such that (vi - 1, vi ) is in A for all 1 ae i ae d. Full Product DetailsAuthor: Lambert M. Surhone , Mariam T. Tennoe , Susan F. HenssonowPublisher: VDM Publishing House Imprint: VDM Publishing House Dimensions: Width: 22.90cm , Height: 0.40cm , Length: 15.20cm Weight: 0.125kg ISBN: 9786131371059ISBN 10: 6131371059 Pages: 76 Publication Date: 20 August 2010 Audience: General/trade , General Format: Paperback Publisher's Status: Active Availability: In Print  This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
