On the complexity of and algorithms for finding the shortest path with a disjoint counterpart.
Dahai XuYang ChenYizhi XiongChunming QiaoXin HePublished in: IEEE/ACM Trans. Netw. (2006)
Keyphrases
- worst case
- computational complexity
- computationally efficient
- complexity analysis
- computational cost
- machine learning algorithms
- database
- computationally expensive
- high computational complexity
- benchmark problems
- benchmark datasets
- finding the shortest path
- complexity measures
- reduced complexity
- lower complexity
- graph theory
- recently developed
- significant improvement
- data streams
- data structure
- machine learning