scientific article; zbMATH DE number 1182573
From MaRDI portal
Publication:4400643
zbMATH Open0905.90172MaRDI QIDQ4400643
Du Ding-Zhu, Guoliang Xue, Frank K. Hwang
Publication date: 10 February 1999
Title of this publication is not available (Why is that?)
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- An algorithm for finding the \(k\) quickest paths in a network π π
- An \(O(n\log n)\) average time algorithm for computing the shortest network under a given topology π π
- Faster network algorithms based on graph decomposition π π
- Faster algorithms for the shortest path problem π π
- The shortest network under a given topology π π
- Optimally fast shortest path algorithms for some classes of graphs π π
- Computing the shortest network under a fixed topology π π
- Faster algorithms for shortest path and network flow based on graph decomposition π π
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400643)