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

Sharir, M.

Couverture rigide

ISBN 10 : 026785773X ISBN 13 : 9780267857739

Editeur : Forgotten Books, 2018

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.

Détails de l'édition

• Éditeur: Forgotten Books
• Date d'édition: 2018
• Langue: anglais
• ISBN 10: 026785773X
• ISBN 13: 9780267857739
• Reliure: Relié
• Nombre de pages: 31
• Coordonnées du fabricant: Copytech (UK) Ltd, Trading as Printondemand-worldwide.com; gpsr@podww.com; ; 9 Culley Court; Orton Southgate; Peterborough; Cambridgeshire; PE2 6WA; Royaume-Uni
• Personne responsable: Easy Access System Europe Oü, 16879218; +358405003575; gpsr.requests@easproject.com; ; Mustamäe tee 50; Tallinn; 10621; Estonie