{"id":"https://openalex.org/keywords/nested-dissection","display_name":"nested dissection","description":"Nested dissection is a recursive graph-partitioning algorithm used to reorder sparse matrices and reduce fill-in during numerical factorization.","display_name_alternatives":["nested dissection ordering","nested dissection algorithm"],"ids":{"openalex":"https://openalex.org/keywords/nested-dissection","wikidata":"https://www.wikidata.org/wiki/Q6997812"},"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.6606,"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"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.6606,"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":374,"cited_by_count":9166,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/nested-dissection","updated_date":"2026-11-17T04:05:58","created_date":"2022-04-12T19:38:12"}
