Verwandte Artikel zu 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)

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

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.

Reseña del editor

Excerpt from A Strong-Connectivity Algorithm and Its Applications in Data Flow Analysis Applications

"This work is based upon work supported partly by the National Science Foudation under Grant No. MCS 076-00116. Any opinions, findings and conclusions or recommendations expressed in this publication are those of the author(s) and do not necessarily reflect the views of the National Science Foundation."

This work is also based upon work supported partly by the U.S. Doe Office of Energy Research Contract EY-76-C-02-3077.

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Gebraucht kaufen

Zustand: Sehr gut
Zustand: Sehr gut | Sprache: Englisch...
Diesen Artikel anzeigen

Gratis für den Versand innerhalb von/der Deutschland

Versandziele, Kosten & Dauer

EUR 0,79 für den Versand von USA nach Deutschland

Versandziele, Kosten & Dauer

Weitere beliebte Ausgaben desselben Titels

Suchergebnisse für A Strong-Connectivity Algorithm and Its Applications...

Beispielbild für diese ISBN

M. Sharir
Verlag: Forgotten Books, 2015
ISBN 10: 1332201032 ISBN 13: 9781332201037
Gebraucht Softcover

Anbieter: Buchpark, Trebbin, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Artikel-Nr. 26066582/2

Verkäufer kontaktieren

Gebraucht kaufen

EUR 14,75
Währung umrechnen
Versand: Gratis
Innerhalb Deutschlands
Versandziele, Kosten & Dauer

Anzahl: 1 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

M. Sharir
Verlag: Forgotten Books, 2018
ISBN 10: 1332201032 ISBN 13: 9781332201037
Neu PAP

Anbieter: PBShop.store US, Wood Dale, IL, USA

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Artikel-Nr. LW-9781332201037

Verkäufer kontaktieren

Neu kaufen

EUR 18,51
Währung umrechnen
Versand: EUR 0,79
Von USA nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: 15 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

M. Sharir
Verlag: Forgotten Books, 2018
ISBN 10: 1332201032 ISBN 13: 9781332201037
Neu PAP

Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Artikel-Nr. LW-9781332201037

Verkäufer kontaktieren

Neu kaufen

EUR 17,80
Währung umrechnen
Versand: EUR 4,51
Von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: 15 verfügbar

In den Warenkorb