Resultados de la búsqueda para Strongly Connected Component
Imagen del vendedor
Strongly Connected Component
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6131167184
ISBN 13: 9786131167188
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! A directed graph is called strongly connected if there is a path from each vertex in the graph to every other vertex. In particular, this means paths in each direction; a path from a to b and also a path from b to a. The strongly connected components (SCC) of a directed graph G are its maximal strongly connected subgraphs. If each strongly connected component is contracted to a single vertex, the resulting graph is a directed acyclic graph, the condensation of G. A directed graph is acyclic if and only if it has no (nontrivial) strongly connected subgraphs (because a cycle is strongly connected, and every strongly connected graph contains at least one cycle). 80 pp. Englisch. Nº de ref. del artículo: 9786131167188
Comprar nuevo
EUR 34,00
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Strongly Connected Component : Directed Graph, Vertex (Graph Theory), Subgraph, Directed Acyclic Graph, Kosaraju's Algorithm
Impresión bajo demandaLibrería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! A directed graph is called strongly connected if there is a path from each vertex in the graph to every other vertex. In particular, this means paths in each direction; a path from a to b and also a path from b to a. The strongly connected components (SCC) of a directed graph G are its maximal strongly connected subgraphs. If each strongly connected component is contracted to a single vertex, the resulting graph is a directed acyclic graph, the condensation of G. A directed graph is acyclic if and only if it has no (nontrivial) strongly connected subgraphs (because a cycle is strongly connected, and every strongly connected graph contains at least one cycle). Nº de ref. del artículo: 9786131167188
Comprar nuevo
EUR 35,89
Envío por EUR 60,69
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Strongly Connected Component | Directed Graph, Vertex (Graph Theory), Subgraph, Directed Acyclic Graph, Kosaraju's Algorithm
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Strongly Connected Component | Directed Graph, Vertex (Graph Theory), Subgraph, Directed Acyclic Graph, Kosaraju's Algorithm | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131167188 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 113279450
Comprar nuevo
EUR 109,85
Envío por EUR 70,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen del vendedor
Strongly Connected Component
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6131167184
ISBN 13: 9786131167188
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. A directed graphis called strongly connected if there is a path from each vertex in thegraph to every other vertex. In particular, this means paths in eachdirection; a path from a to b and also a path from b to a. The stronglyconnected components (SCC) of a directed graph G are its maximalstrongly connected subgraphs. If each strongly connected component iscontracted to a single vertex, the resulting graph is a directed acyclicgraph, the condensation of G. A directed graph is acyclic if and only ifit has no (nontrivial) strongly connected subgraphs (because a cycle isstrongly connected, and every strongly connected graph contains at leastone cycle).VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 80 pp. Englisch. Nº de ref. del artículo: 9786131167188
Comprar nuevo
EUR 136,00
Envío por EUR 60,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles