{"cited_by_count":1941232,"description":"This cluster of papers focuses on combinatorial optimization, approximation algorithms, complexity theory, graph algorithms, submodular functions, network flows, matrix multiplication, communication complexity, linear programming, and algorithmic applications.","display_name":"Complexity and Algorithms in Graphs","domain_id":"3","external_ids":{"openalex":"https://openalex.org/T10720","wikipedia":"https://en.wikipedia.org/wiki/Combinatorial_optimization"},"field_id":"17","id":"T10720","keywords":[{"display_name":"approximation algorithms","id":"approximation-algorithms","score":0.3762,"url":"https://openalex.org/keywords/approximation-algorithms"},{"display_name":"graph algorithms","id":"graph-algorithms","score":0.3206,"url":"https://openalex.org/keywords/graph-algorithms"},{"display_name":"shortest path","id":"shortest-path","score":0.2229,"url":"https://openalex.org/keywords/shortest-path"},{"display_name":"hardness of approximation","id":"hardness-of-approximation","score":0.5244,"url":"https://openalex.org/keywords/hardness-of-approximation"},{"display_name":"approximation ratio","id":"approximation-ratio","score":0.4519,"url":"https://openalex.org/keywords/approximation-ratio"},{"display_name":"randomized algorithms","id":"randomized-algorithms","score":0.224,"url":"https://openalex.org/keywords/randomized-algorithms"},{"display_name":"P versus NP","id":"p-versus-np","score":0.4783,"url":"https://openalex.org/keywords/p-versus-np"},{"display_name":"minimum spanning tree","id":"minimum-spanning-tree","score":0.2139,"url":"https://openalex.org/keywords/minimum-spanning-tree"},{"display_name":"undirected graphs","id":"undirected-graphs","score":0.2925,"url":"https://openalex.org/keywords/undirected-graphs"},{"display_name":"maximum flow","id":"maximum-flow","score":0.4698,"url":"https://openalex.org/keywords/maximum-flow"},{"display_name":"network flow","id":"network-flow","score":0.3982,"url":"https://openalex.org/keywords/network-flow"},{"display_name":"linear programming relaxation","id":"linear-programming-relaxation","score":0.2734,"url":"https://openalex.org/keywords/linear-programming-relaxation"},{"display_name":"communication complexity","id":"communication-complexity","score":0.2382,"url":"https://openalex.org/keywords/communication-complexity"},{"display_name":"complexity classes","id":"complexity-classes","score":0.3961,"url":"https://openalex.org/keywords/complexity-classes"},{"display_name":"query complexity","id":"query-complexity","score":0.2896,"url":"https://openalex.org/keywords/query-complexity"},{"display_name":"circuit complexity","id":"circuit-complexity","score":0.4557,"url":"https://openalex.org/keywords/circuit-complexity"},{"display_name":"Steiner tree problem","id":"steiner-tree-problem","score":0.3429,"url":"https://openalex.org/keywords/steiner-tree-problem"},{"display_name":"shortest path algorithms","id":"shortest-path-algorithms","score":0.2319,"url":"https://openalex.org/keywords/shortest-path-algorithms"},{"display_name":"weighted graphs","id":"weighted-graphs","score":0.2033,"url":"https://openalex.org/keywords/weighted-graphs"},{"display_name":"polynomial-time approximation scheme","id":"polynomial-time-approximation-scheme","score":0.4016,"url":"https://openalex.org/keywords/polynomial-time-approximation-scheme"},{"display_name":"derandomization","id":"derandomization","score":0.5271,"url":"https://openalex.org/keywords/derandomization"},{"display_name":"circuit lower bounds","id":"circuit-lower-bounds","score":0.7937,"url":"https://openalex.org/keywords/circuit-lower-bounds"},{"display_name":"maximum matching","id":"maximum-matching","score":0.3953,"url":"https://openalex.org/keywords/maximum-matching"},{"display_name":"multicommodity flow","id":"multi-commodity-flow","score":0.3777,"url":"https://openalex.org/keywords/multi-commodity-flow"},{"display_name":"polynomial hierarchy","id":"polynomial-hierarchy","score":0.4214,"url":"https://openalex.org/keywords/polynomial-hierarchy"}],"legacy_keywords":["Combinatorial Optimization","Approximation Algorithms","Complexity Theory","Graph Algorithms","Submodular Functions","Network Flows","Matrix Multiplication","Communication Complexity","Linear Programming","Algorithmic Applications"],"openalex_id":"https://openalex.org/T10720","source_created_date":"2024-01-23T15:27:07","source_updated_date":"2026-10-17T03:02:00","subfield_id":"1703","url":"/topics/T10720","works_api_url":"https://api.openalex.org/works?filter=topics.id:T10720","works_count":120898,"label":"Complexity and Algorithms in Graphs","provider":"openalex","revision":"2b8cc275bcaf87e6","taxonomy_revision":"f050b5d4780b1289","title":"Complexity and Algorithms in Graphs","kind":"topic-directory","aeo_cohort":"topic-directory","catalogue_revision":"f050b5d4780b1289","numeric_address":"36174245159634007","address_version":"morton4x16-v1","coordinates":[3,17,1703,10720],"answer_status":"Directory metadata; local answer requires separate source review","truth_status":"Subject descriptor, not a factual answer or a demonstrated knowledge gap","reviewed_answer":null}