Science Explorer Back to mapMap
Discussion
Topic · Computational Theory and Mathematics

Complexity and Algorithms in Graphs

Complexity and Algorithms in Graphs is a research topic within Computational Theory and Mathematics. Science Explorer counts 21k research works in it since 1959. 9.9% of them reached the world's top 10% most cited for their field and year.

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.

  • Combinatorial Optimization
  • Approximation Algorithms
  • Complexity Theory
  • Graph Algorithms
  • Submodular Functions
  • Network Flows
  • Matrix Multiplication
  • Communication Complexity
  • Linear Programming
  • Algorithmic Applications
Research works
21k
fractional, since 1959
In the world top 10%
2.1k
per year above
Top-10% rate
9.9%
share of its works in the world top 10%
Growth, 2018-21 → 2022-25
-4%
the tick is no change
Largest producer
United States
29% of the 10 largest, 2022-now
Complexity and Algorithms in Graphs
Drawing this view