Collaborative Research: AF: Medium: Fast Combinatorial Algorithms for (Dynamic) Matchings — NSF Award to New York University (NY,
A graph is a collection of vertices (points or objects), and a collection of edges (links or lines), that connect pairs of vertices. Graphs are a central and an extensively studied type of mathematical object, and they are commonly used to model various problems in many different real world scenarios and applications.
| Award title | Collaborative Research: AF: Medium: Fast Combinatorial Algorithms for (Dynamic) Matchings |
|---|---|
| Award ID | 2625203 |
| Awardee | New York University |
| City | NEW YORK |
| State | NY |
| Amount obligated | $370,237 |
| Principal investigator | Sanjeev Khanna |
| Program | Algorithmic Foundations |
| Start date | 01/01/2026 |
| Abstract | A graph is a collection of vertices (points or objects), and a collection of edges (links or lines), that connect pairs of vertices. Graphs are a central and an extensively studied type of mathematical object, and they are commonly used to model various problems in many different real world scenarios and applications. For example, it is natural to model a road network in a city, or a computer network, or friendship relationships in a social network as a graph. There are countless other scenarios |
| Source | NSF Awards |
$799/mo
Try NSFGrants →