Articoli correlati a A Strong-Connectivity Algorithm and Its Applications...
A Strong-Connectivity Algorithm and Its Applications in Data Flow Analysis Applications (Classic Reprint) - Brossura
Sinossi
Excerpt from A Strong-Connectivity Algorithm and Its Applications in Data Flow Analysis Applications
Let us assume that we are given a directed graph G rooted at a unique 'entry' node r. Let N be the set of nodes of G and E the set of its edges. For each n E N denote by scc(n) the strongly-connected component of G containing n, i.e. The maximal set of nodes containing n such that G restricted to that set is strongly connected. Let T be a depth-first spanning tree for G.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 18,47
EUR 1,92 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per A Strong-Connectivity Algorithm and Its Applications...
Foto dell'editore
A StrongConnectivity Algorithm and Its Applications in Data Flow Analysis Applications Classic Reprint
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332201037
Quantità: 15 disponibili
Foto dell'editore
A StrongConnectivity Algorithm and Its Applications in Data Flow Analysis Applications Classic Reprint
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332201037
Quantità: 15 disponibili
Foto dell'editore
A Strong-Connectivity Algorithm and Its Applications in Data Flow Analysis Applications (Classic Reprint)
Da: Buchpark, Trebbin, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Codice articolo 26066582/2
Quantità: 1 disponibili
Immagini fornite dal venditore
A Strong-Connectivity Algorithm and Its Applications in Data Flow Analysis
Print on DemandDa: Forgotten Books, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: New. Print on Demand. This book presents an efficient algorithm for identifying strongly connected components within directed graphs. The algorithm, developed by the author, offers a significant improvement over existing methods by producing components in reverse postorder and organizing nodes within each component in the same order. This ordering facilitates iterative algorithms used in data flow analysis, leading to a simpler and more efficient approach. The book delves into the theoretical foundations of the algorithm, proving its correctness and analyzing its time complexity. It also explores applications in data flow analysis, demonstrating how the algorithm can enhance the accuracy and efficiency of data flow analysis problems. Overall, this book provides valuable insights into graph connectivity and offers a practical solution for optimizing data flow analysis in computer science applications. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Codice articolo 9781332201037_0
Quantità: Più di 20 disponibili