scientific article; zbMATH DE number 5631939
From MaRDI portal
Publication:3644697
zbMATH Open1187.90241MaRDI QIDQ3644697FDOQ3644697
Authors: Binwu Zhang, Qin Wang, Weiyan Yu 
Publication date: 11 November 2009
Title of this publication is not available (Why is that?)
Recommendations
- The shortest path improvement problems under Hamming distance
- Algorithms for the shortest path improvement problems under unit Hamming distance
- The complexity analysis of the shortest path improvement problem under the Hamming distance
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
- An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance
- Improvement of shortest path of arborescent network in the case of Hamming distance
- An Improved Distribution Algorithm for Shortest Paths Problem
- Efficient algorithms for the reverse shortest path problem on trees under the Hamming distance
- scientific article; zbMATH DE number 1445365
Cited In (7)
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
- Improvement of shortest path of arborescent network in the case of Hamming distance
- Algorithms for the shortest path improvement problems under unit Hamming distance
- The complexity analysis of the shortest path improvement problem under the Hamming distance
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance
- The center location improvement problem under the Hamming distance
- The shortest path improvement problems under Hamming distance
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 Q3644697)
