Work

An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages

Year: 1994

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/3-540-57899-4_65

Author: S. Haldar

Institution: Utrecht University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W1246069834

FWCI: 0.701

Cites: 9

Cited by: 5

Related to: 10