LANL Internship: Efficient Shortest Path Computation in Planar Graphs

Project: Research project

Project Details

Description

LANL Internship: Efficient Shortest Path Computation in Planar Graphs LANL Internship: Efficient Shortest Path Computation in Planar Graphs
StatusFinished
Effective start/end date10/10/061/31/07

Funding

  • Los Alamos National Laboratory (LANL): $20,964.00