HETEROGENIOUS BLOCKED ALL-PAIRS SHORTEST PATHS ALGORITHM

The problem of finding the shortest paths between all pairs of vertices in a weighted directed graph is considered. The algorithms of Dijkstra and Floyd-Warshall, homogeneous block and parallel algorithms and other algorithms of solving this problem are known. A new heterogeneous block algorithm is...

Бүрэн тодорхойлолт

Номзүйн дэлгэрэнгүй

Үндсэн зохиолчид:	A. A. Prihozhy, O. N. Karasik
Формат:	Artigo
Хэл сонгох:	Inglês
Хэвлэсэн:	Belarusian National Technical University 2017-11-01
Цуврал:	Системный анализ и прикладная информатика
Нөхцлүүд:	floyd-warshall algorithm all pairs shortest paths heterogeneous block algorithm multi-core system shared cache memory
Онлайн хандалт:	https://sapi.bntu.by/jour/article/view/178
Шошгууд:	Шошго нэмэх Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!