SKU/Artículo: AMZ-0265945135

An Asynchronous Parallel Algorithm for Undirected Graph Connectivity (Classic Reprint)

Format:

Hardcover

Hardcover

Paperback

Detalles del producto
Disponibilidad:
En stock
Peso con empaque:
0.41 kg
Devolución:
Condición
Nuevo
Producto de:
Amazon
Viaja desde
USA

Sobre este producto
  • A proven path to fast graph connectivity on parallel systems.This nonfiction book details an asynchronous parallel algorithm for checking connectivity in undirected graphs, using a PRAM-style model with many processors. It shows how the method runs in logarithmic rounds and how the algorithm progresses from many active edges to a single connected structure.Learn how the algorithm operates in two stages: Stage 1 reduces complexity and prunes the graph, while Stage 2 finishes by consolidating components into a single leader per component.Understand the roles of core and peripheral vertices, final leaders, and how auxiliary graphs help track progress without slowing computation.Discover the mechanics of doubling and hooking operations, and how dynamic pointers guide the process toward a correct connected component.See how the method guarantees termination in O(log n) rounds with n plus e processors, and how it handles multiple components in parallel.Ideal for readers of advanced parallel algorithms, distributed computing, and graph processing who want a clear view of how a sophisticated connectivity procedure is designed and analyzed.
U$S 56,61
44% OFF
U$S 31,45

IMPORTÁ FACIL

Comprando este producto podrás descontar el IVA con tu número de RUT

NO CONSUME FRANQUICIA

Si tu carrito tiene solo libros o CD’s, no consume franquicia y podés comprar hasta U$S 1000 al año.

U$S 56,61
44% OFF
U$S 31,45

¡Comprá en hasta 12 cuotas sin interés con todas tus tarjetas!

Llega en 11 a 15 días hábiles
con envío
Tienes garantía de entrega