ScholarIQanswers from OpenAlex
Complexity and Algorithms in Graphs
TopicLeading institutions, researchers & key papers
Complexity and Algorithms in Graphs is a topic indexed in ScholarIQ from OpenAlex.
What is known about Complexity and Algorithms in Graphs?
ScholarIQrecord summary
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.
How many works does Complexity and Algorithms in Graphs have?
ScholarIQindexed works
Complexity and Algorithms in Graphs has 39,213 works in the ScholarIQ index. The count is the OpenAlex total, not the number of papers listed on this page.
How many citations does Complexity and Algorithms in Graphs have?
ScholarIQcitation count
Complexity and Algorithms in Graphs has 540,247 citations in the OpenAlex counts ScholarIQ stores.
What is the OpenAlex record for Complexity and Algorithms in Graphs?
ScholarIQopenalex
The OpenAlex for Complexity and Algorithms in Graphs is on the source record.
Who are the most-cited researchers behind Complexity and Algorithms in Graphs?
ScholarIQtop researchers by citations
4
C. Padilla Aranda · Particle physics theoretical and experimental studies
1,661 works110,740 citationsWhere is Complexity and Algorithms in Graphs research published, and who funds it?
ScholarIQvenues & funding sources
TOP JOURNALS
No journal data available yet.
TOP FUNDERS
National Science Foundation—
NIH—
Wellcome Trust—
European Research Council—
Funder breakdown is a member featureSign up free to unlock