Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Communications of the ACM
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
Incremental computation of shortest paths in semi-dynamic graphs using software components
Proceedings of the 44th annual Southeast regional conference
Sparse Key Points Controlled Animation for Individual Face Model
Edutainment '08 Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment
Adaptive Routing of Cruising Taxis by Mutual Exchange of Pathways
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Approximation algorithms for temporal reasoning
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Adaptive routing of multiple taxis by mutual exchange of pathways
International Journal of Knowledge Engineering and Soft Data Paradigms
The shortest path problem revisited: optimal routing for electric vehicles
KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence
Norm convergence in populations of dynamically interacting agents
AICS'09 Proceedings of the 20th Irish conference on Artificial intelligence and cognitive science
The influence of random interactions and decision heuristics on norm evolution in social networks
Computational & Mathematical Organization Theory
Heuristic approaches to service level agreements in packet networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
A cross-layer communication module for the Internet of Things
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Journal of Discrete Algorithms
A metric for dynamic routing based on variational principles
Journal of High Speed Networks
| Hi-index | 0.00 |
An assertion that Dijkstra's algorithm for shortest paths (adapted to allow arcs of negative weight) runs in O(n3) steps is disproved by showing a set of networks which take O(n2n) steps.