Un algorithme parallèle efficace pour construire un arbre de poids minimal dans un graphe

DOI10.1051/RO/1985190100571zbMath0571.90092OpenAlexW2477670269MaRDI QIDQ3688127

Ivan Lavallée

Publication date: 1985

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104870

zbMATH Keywords

parallel algorithmsminimum spanning treemutual exclusionvalued undirected graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35)

This page was built for publication: Un algorithme parallèle efficace pour construire un arbre de poids minimal dans un graphe