Johnson's algorithm

Summary

Johnson's algorithm is an algorithm^[1]. It draws 101 Wikipedia views per month (algorithm category, ranking #84 of 337).^[2]

Key Facts

• Johnson's algorithm is credited with the discovery of Donald B. Johnson^[3].
• Johnson's algorithm's instance of is recorded as algorithm^[4].
• Johnson's algorithm's instance of is recorded as graph algorithm^[5].
• Johnson's algorithm's instance of is recorded as shortest path problem^[6].
• Donald B. Johnson is named after Johnson's algorithm^[7].
• Johnson's algorithm's Commons category is recorded as Johnson's algorithm^[8].
• Johnson's algorithm's publication date is recorded as +1977-00-00T00:00:00Z^[9].
• Johnson's algorithm's Freebase ID is recorded as /m/04q0b2^[10].
• Johnson's algorithm's computes solution to is recorded as all-pairs shortest path problem^[11].
• Johnson's algorithm's uses is recorded as graph data structure^[12].
• Johnson's algorithm's worst-case time complexity is recorded as O (|V|^2 \log |V| + |V||E|)^[13].
• Johnson's algorithm's Dictionary of Algorithms and Data Structures ID is recorded as johnsonsAlgorithm^[14].
• Johnson's algorithm's Microsoft Academic ID is recorded as 10187374^[15].
• Johnson's algorithm's Brilliant Wiki ID is recorded as johnsons-algorithm^[16].

Body

Designation and Status

Recorded instance of include algorithm^[4], graph algorithm^[5], and shortest path problem^[6].

History and Context

Donald B. Johnson is named after Johnson's algorithm^[7].

Why It Matters

Johnson's algorithm draws 101 Wikipedia views per month (algorithm category, ranking #84 of 337).^[2] It has Wikipedia articles in 15 language editions, a strong signal of global cultural recognition.^[17] It is known by 3 alternative names across languages and contexts.^[18]