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

Sharir, M.

Rilegato

ISBN 10: 026785773X ISBN 13: 9780267857739

Casa editrice: Forgotten Books, 2018

Riassunto

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.

Dettagli dell'edizione

• Editore: Forgotten Books
• Data di pubblicazione: 2018
• Lingua: Inglese
• ISBN 10: 026785773X
• ISBN 13: 9780267857739
• Rilegatura: Copertina rigida
• Numero di pagine: 30
• Contatto del produttore: non disponibile
• Persona responsabile: Bärenreiter-Verlag Karl Vötterle GmbH & Co. KG; bscheuch@baerenreiter.com; ; Heinrich-Schütz-Allee 35-37; Kassel; Germania; 34131; Germania