grant

CAREER: A New Theory of Length-Constrained Graph Algorithms

Organization Brown UniversityLocation PROVIDENCE, United StatesPosted 1 Jun 2026Deadline 31 May 2031
NSFUS FederalResearch GrantScience FoundationRI
Get Agency plan to apply$29.99/mo · 7-day free trial · pipeline · alerts
— or —

Get email alerts for similar roles

Weekly digest · no password needed · unsubscribe any time

Description preview

The field of graph algorithms aims to understand how to efficiently construct and use networks, as well as what properties make for a good network. This project aims to advance graph algorithms by way of a new theory of “length-constrained” graph algorithms. Length constraints are a way of encouraging communication to happen quickly in networks.…

🔒

Full details available on the Agency plan

Unlock the complete grant description, eligibility criteria, contract value, evaluation details and apply link — plus alerts, pipeline tracking, and CSV export.

Start 7-day free trial — $29.99/mo →

Agency Plan

7-day free trial

Unlock procurement & grants

Upgrade to access active tenders from World Bank, UNDP, ADB and more — with email alerts and pipeline tracking.

$29.99 / month

  • 🔔Email alerts for new matching tenders
  • 🗂️Track tenders in your pipeline
  • 💰Filter by contract value
  • 📥Export results to CSV
  • 📌Save searches with one click
Start 7-day free trial →

Explore more

📍 More grants in United States🏷 More NSF opportunities🏷 More US Federal opportunities🏷 More Research Grant opportunities🏢 All nsf_awards opportunities
CAREER: A New Theory of Length-Constrained Graph Algorithms — Brown University | United States | Jun 2026 | Dev Procure