Speed of parallel processing for random task graphs

DOI10.1002/CPA.3160470307zbMath0822.68027OpenAlexW1995046170WikidataQ126265698 ScholiaQ126265698MaRDI QIDQ4296343

Marco Isopi, Charles M. Newman

Publication date: 19 June 1994

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cpa.3160470307

zbMATH Keywords

random graph model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

Limiting properties of random graph models with vertex and edge weights ⋮ On the asymptotics for the minimal distance between extreme vertices in a generalised Barak-Erdős graph ⋮ Probabilistic and analytical properties of the last passage percolation constant in a weighted random directed graph ⋮ Limit theorems for a random directed slab graph ⋮ Long-range last-passage percolation on the line ⋮ Unnamed Item ⋮ Limit theorems for the maximal path weight in a directed graph on the line with random weights of edges ⋮ Barak-Erdős graphs and the infinite-bin model ⋮ Two-sided infinite-bin models and analyticity for Barak-Erdős graphs

Cites Work

• Unnamed Item

This page was built for publication: Speed of parallel processing for random task graphs