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 14 works in the ScholarIQ index. The count is the OpenAlex total, not the number of papers listed on this page.
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.
What are the most-cited papers on Complexity and Algorithms in Graphs?
ScholarIQmost cited works
A Randomized Rounding Approach to the Traveling Salesman Problem
Shayan Oveis Gharan, Amin Saberi, Mohit Singh
Approximating minimum bounded degree spanning trees to within one of optimal
Mohit Singh, Lap Chi Lau
Crown Structures for Vertex Cover Kernelization
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, W. Henry Suters
Survivable Network Design with Degree or Order Constraints
Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh
Survivable network design with degree or order constraints
Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh
Where is Complexity and Algorithms in Graphs research published, and who funds it?
ScholarIQvenues & funding sources
TOP JOURNALS
TOP FUNDERS
National Science Foundation—
NIH—
Wellcome Trust—
European Research Council—
Funder breakdown is a member featureSign up free to unlock
How much of the research on Complexity and Algorithms in Graphs is open access?
ScholarIQopen access share
0%OPEN ACCESS