Items related to A Strong-Connectivity Algorithm and Its Applications...

A Strong-Connectivity Algorithm and Its Applications in Data Flow Analysis Applications (Classic Reprint) - Softcover

 
9781332201037: A Strong-Connectivity Algorithm and Its Applications in Data Flow Analysis Applications (Classic Reprint)

Synopsis

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.

"synopsis" may belong to another edition of this title.

Product Description

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.

"About this title" may belong to another edition of this title.

Buy Used

Condition: Fine
Zustand: Sehr gut | Sprache: Englisch...
View this item

£ 7.68 shipping from Germany to United Kingdom

Destination, rates & speeds

Other Popular Editions of the Same Title

Search results for A Strong-Connectivity Algorithm and Its Applications...

Seller Image

M. Sharir
Published by Forgotten Books, 2018
ISBN 10: 1332201032 ISBN 13: 9781332201037
New Paperback
Print on Demand

Seller: Forgotten Books, London, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Paperback. Condition: 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. Seller Inventory # 9781332201037_0

Contact seller

Buy New

£ 13.03
Convert currency
Shipping: FREE
Within United Kingdom
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

M. Sharir
Published by Forgotten Books, 2018
ISBN 10: 1332201032 ISBN 13: 9781332201037
New PAP

Seller: PBShop.store UK, Fairford, GLOS, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332201037

Contact seller

Buy New

£ 14.88
Convert currency
Shipping: FREE
Within United Kingdom
Destination, rates & speeds

Quantity: 15 available

Add to basket

Stock Image

M. Sharir
Published by Forgotten Books, 2018
ISBN 10: 1332201032 ISBN 13: 9781332201037
New PAP

Seller: PBShop.store US, Wood Dale, IL, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332201037

Contact seller

Buy New

£ 15.91
Convert currency
Shipping: FREE
From U.S.A. to United Kingdom
Destination, rates & speeds

Quantity: 15 available

Add to basket

Stock Image

M. Sharir
Published by Forgotten Books, 2015
ISBN 10: 1332201032 ISBN 13: 9781332201037
Used Softcover

Seller: Buchpark, Trebbin, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 26066582/2

Contact seller

Buy Used

£ 13.12
Convert currency
Shipping: £ 7.68
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 1 available

Add to basket