{"id":"https://openalex.org/keywords/decrease-key-operation","display_name":"decrease-key operation","description":"A priority-queue operation that lowers the priority value of an existing element, commonly used in graph algorithms and heap data structures.","display_name_alternatives":["decrease key","decrease-key operations"],"ids":{"openalex":"https://openalex.org/keywords/decrease-key-operation","wikidata":null},"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.6325,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.6325,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.2568,"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":95,"cited_by_count":1312,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/decrease-key-operation","updated_date":"2026-11-18T04:07:20","created_date":"2026-09-30T00:00:00"}
