{"id":"https://openalex.org/keywords/johnson-s-algorithm","display_name":"Johnson's algorithm","description":"A graph algorithm for finding shortest paths between every pair of vertices in a sparse, weighted, directed graph.","display_name_alternatives":["Johnson algorithm","Johnson's shortest path algorithm","Johnson's all-pairs shortest path algorithm"],"ids":{"openalex":"https://openalex.org/keywords/johnson-s-algorithm","wikidata":"https://www.wikidata.org/wiki/Q2345824"},"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.4737,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.4737,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1658,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":315,"cited_by_count":4947,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/johnson-s-algorithm","updated_date":"2026-11-16T04:05:30","created_date":"2026-09-30T00:00:00"}
