{"id":"https://openalex.org/keywords/graph-pruning","display_name":"graph pruning","description":"Graph pruning is the removal of selected vertices, edges, or substructures to simplify graph computation while retaining relevant information.","display_name_alternatives":["pruning graphs","graph trimming"],"ids":{"openalex":"https://openalex.org/keywords/graph-pruning","wikidata":null},"primary_topic":null,"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.0741,"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":561,"cited_by_count":7666,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/graph-pruning","updated_date":"2026-11-19T04:05:57","created_date":"2026-09-30T00:00:00"}
