grant

Density and Algorithms in Edge Coloring and Packing

Organization University of Massachusetts LowellLocation LOWELL, United StatesPosted 15 Jan 2025Deadline 31 Dec 2027
NSFUS FederalResearch GrantScience FoundationMA
Sign up free to applyApply link · pipeline · email alerts
— or —

Get email alerts for similar roles

Weekly digest · no password needed · unsubscribe any time

Description preview

Graphs, which can be thought of as a collection of nodes, called vertices, and connections between certain of these nodes, called edges, play an important role in the theory of networks, communication, scheduling, and optimization. Edge coloring and edge packing can be considered partitions of the edges of a graph under certain restrictions. For…

🔒

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 →
Density and Algorithms in Edge Coloring and Packing — University of Massachusetts Lowell | United States | Jan 2025 | Dev Procure