Search results for "Dijkstra's algorithm"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm	Partitioning graphs to speedup Dijkstra's algorithm.	ACM Journal of Experimental Algorithmics	2006	DBLP DOI BibTeX RDF	acceleration method, Shortest path, road network, Dijkstra's algorithm
3	Holger Bast, Kurt Mehlhorn, Guido Schäfer	A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms.	Algorithmica	2003	DBLP DOI BibTeX RDF	Single-source shortest-path problem, Weighted bipartite matching problem, Assignment problem, Dijkstra's algorithm
2	Nikos Anastopoulos, Konstantinos Nikas, Georgios I. Goumas, Nectarios Koziris	Early experiences on accelerating Dijkstra's algorithm using transactional memory.	IPDPS	2009	DBLP DOI BibTeX RDF
2	Victor Teixeira de Almeida, Ralf Hartmut Güting	Using Dijkstra's algorithm to incrementally find the k-Nearest Neighbors in spatial network databases.	SAC	2006	DBLP DOI BibTeX RDF	location-based services, spatial databases, nearest neighbors, index structures
2	Richard E. Korf, Weixiong Zhang, Ignacio Thayer, Heath Hohwald	Frontier search.	J. ACM	2005	DBLP DOI BibTeX RDF	bidirectional search, sliding-tile puzzles, heuristic search, sequence alignment, Dijkstra's algorithm, breadth-first search, best-first search, A* algorithm, Towers of Hanoi
2	Martin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm	Combining speed-up techniques for shortest-path computations.	ACM Journal of Experimental Algorithmics	2005	DBLP DOI BibTeX RDF	Shortest path, combination, speed-up, Dijkstra's algorithm
2	Alexandre X. Falcão, Jorge Stolfi, Roberto de Alencar Lotufo	The Image Foresting Transform: Theory, Algorithms, and Applications.	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF	regional minima, boundary tracking, distance transforms and multiscale skeletonization, image segmentation, image analysis, shortest-path problems, Dijkstra's algorithm, watershed transform, morphological reconstruction
2	Kurt Mehlhorn, Guido Schäfer	A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms.	ESA	2001	DBLP DOI BibTeX RDF
2	Takashi Kanai, Hiromasa Suzuki	Approximate Shortest Path on Polyhedral Surface Based on Selective Refinement of the Discrete Graph and Its Applications. (PDF / PS)	GMP	2000	DBLP DOI BibTeX RDF	computational geometry, geometric modeling, shortest path, Dijkstra's algorithm, polyhedral surface
2	Frank Schulz, Dorothea Wagner, Karsten Weihe	Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Mikkel Thorup	Undirected Single Source Shortest Path in Linear Time.	FOCS	1997	DBLP DOI BibTeX RDF	single source shortest paths problem, algorithmic graph theory, deterministic linear time, hierarchical bucketing, deterministic algorithms, linear time, weighted graph, Dijkstra's algorithm, linear space
2	Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis	A Parallel Priority Data Structure with Applications. (PDF / PS)	IPPS	1997	DBLP DOI BibTeX RDF	parallel priority data structure, algorithm running time, data structures, time complexity, iteration, parallel implementation, Dijkstra's algorithm, CREW PRAM
1	Petr Hlinený, Ondrej Moris	Dynamic Scope-Based Dijkstra's Algorithm	CoRR	2012	DBLP BibTeX RDF
1	Ariel Felner	Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm.	SOCS	2011	DBLP BibTeX RDF
1	Wen-Chih Chang, Te-Hua Wang, Yan-Da Chiu	Board Game Supporting Learning Prim's Algorithm and Dijkstra's Algorithm.	IJMDEM	2010	DBLP DOI BibTeX RDF
1	Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner	Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm.	ACM Journal of Experimental Algorithmics	2010	DBLP DOI BibTeX RDF
1	DongKai Fan, Ping Shi	Improvement of Dijkstra's algorithm and its application in route planning.	FSKD	2010	DBLP DOI BibTeX RDF
1	Yusuke Sakumoto, Hiroyuki Ohsaki, Makoto Imase	On the Effectiveness of Thorup's Shortest Path Algorithm for Large-Scale Network Simulation.	SAINT	2010	DBLP DOI BibTeX RDF	single-souce shortest-path problem, large-scale network simulation, thorup's algorithm, dijkstra's algorithm
1	Leo Grady	Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D.	IEEE Trans. Pattern Anal. Mach. Intell.	2010	DBLP DOI BibTeX RDF	boundary operator, total unimodularity, minimum-cost circulation network flow, linear programming, shortest paths, Dijkstra's algorithm, minimal surfaces, 3D image segmentation
1	Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Slivkins	Truthful mechanisms with implicit payment computation.	ACM Conference on Electronic Commerce	2010	DBLP DOI BibTeX RDF	single-parameter mechanism design, truthful auctions, multi-armed bandits
1	M. Gloria Sánchez-Torrubia, Carmen Torres-Blanc, M. A. López-Martínez	PathFinder: A Visualization eMathTeacher for Actively Learning Dijkstra's Algorithm.	Electr. Notes Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Konstantinos Nikas, Nikos Anastopoulos, Georgios I. Goumas, Nectarios Koziris	Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm.	ICPP	2009	DBLP DOI BibTeX RDF
1	Jason J. Holdsworth, Siu Man Lui	GPS-enabled mobiles for learning shortest paths: a pilot study.	FDG	2009	DBLP DOI BibTeX RDF	GPS-enabled mobile phones, mobile learning, problem-based learning, shortest paths algorithm
1	Shi-Qing Xin, Guo-Jin Wang	Improving Chen and Han's algorithm on the discrete geodesic problem.	ACM Trans. Graph.	2009	DBLP DOI BibTeX RDF	computational geometry, shortest path problems, Design and analysis of algorithms
1	Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu	Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels	CoRR	2008	DBLP BibTeX RDF
1	Wen-Chih Chang, Yan-Da Chiu, Mao-Fan Li	Learning Kruskal's Algorithm, Prim's Algorithm and Dijkstra's Algorithm by Board Game.	ICWL	2008	DBLP DOI BibTeX RDF
1	Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner	Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm.	WEA	2008	DBLP DOI BibTeX RDF
1	Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu	Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels.	ISIT	2008	DBLP DOI BibTeX RDF
1	Youming Li, Ardian N. Greca, James Harris	On Dijkstra's Algorithm for Deadlock Detection.	SCSS	2008	DBLP DOI BibTeX RDF
1	Ricardo Fabbri, Luciano da Fontoura Costa, Julio C. Torelli, Odemir Martinez Bruno	2D Euclidean distance transform algorithms: A comparative survey.	ACM Comput. Surv.	2008	DBLP DOI BibTeX RDF	exact Euclidean distance map, performance evaluation, computational geometry, shape analysis, Distance transform, Dijkstra's algorithm
1	Thomas Hazel, Laura Toma, Jan Vahrenhold, Rajiv Wickremesinghe	Terracost: Computing least-cost-path surfaces for massive grid terrains.	ACM Journal of Experimental Algorithmics	2008	DBLP DOI BibTeX RDF	terrain data, shortest paths, Dijkstra's algorithm, I/O-efficiency, Data structures and algorithms
1	Martin Holzer, Frank Schulz, Dorothea Wagner	Engineering multilevel overlay graphs for shortest-path queries.	ACM Journal of Experimental Algorithmics	2008	DBLP DOI BibTeX RDF	overlay graph, vertex selection, shortest path, preprocessing, hierarchical, Dijkstra's algorithm, multilevel, speed-up technique
1	Josep Miquel Jornet, Milica Stojanovic, Michele Zorzi	Focused beam routing protocol for underwater acoustic networks.	Underwater Networks	2008	DBLP DOI BibTeX RDF	routing, power control, underwater acoustic networks
1	Khaled Maamoun, Hussein T. Mouftah	A simple scheme for routing and wavelength assignment in WDM networks.	SpringSim	2008	DBLP DOI BibTeX RDF	link-weight, node-weight, wavelength constraint, routing and wavelength assignment, WDM network
1	Stephen L. Spitler, Daniel C. Lee	Integration of explicit effective-bandwidth-based QoS routing with best-effort routing.	IEEE/ACM Trans. Netw.	2008	DBLP DOI BibTeX RDF	best-effort (BE) traffic, quality of service (QoS), dynamic routing, effective bandwidth, constraint-based routing
1	Scott Morris, Kobus Barnard	Finding trails.	CVPR	2008	DBLP DOI BibTeX RDF
1	Takashi Kanai, Yutaka Ohtake	Discrete shortest paths on smooth surface representations.	Shape Modeling International	2008	DBLP DOI BibTeX RDF
1	Edwin Soedarmadji	Finding the Best QoS Path in a Gilbert Channel Network.	VTC Spring	2008	DBLP DOI BibTeX RDF
1	Quan Yu, Baoxian Zhang, Chao Liu, H. T. Mouftah	Energy-Efficient Geographical Forwarding Algorithm for Wireless Ad Hoc and Sensor Networks.	WCNC	2008	DBLP DOI BibTeX RDF
1	João Miguel Ferro, Fernando J. Velez	Routing in a Custom-Made IEEE 802.11E Simulator.	World Congress on Engineering (Selected Papers)	2008	DBLP DOI BibTeX RDF	IEEE 802.11E Simulator, Custom-Made, multi-hop environment, Routing, network simulation
1	Jeremy Long, David Mould	Improved image quilting.	Graphics Interface	2007	DBLP DOI BibTeX RDF
1	Cong Liu, Jie Wu	Scalable routing in delay tolerant networks.	MobiHoc	2007	DBLP DOI BibTeX RDF	motion cycle, simulation, scalability, delay tolerant networks (DTNs), contact, hierarchical routing, delivery
1	Zhenghao Zhang, Yuanyuan Yang	On-line optimal wavelength assignment in WDM networks with shared wavelength converter pool.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	shared wavelength converter pool, routing, multicast, optical networks, on-line algorithms, wavelength division multiplexing (WDM), wavelength assignment, unicast, wavelength conversion
1	Jun Wang, Xiaobo Zhou, Ju Lu, Jeff Lichtman, Shih-Fu Chang, Stephen T. C. Wong	Dynamic Local Tracing for 3d Axon Curvilinear Structure Detection from Microscopic Image Stack.	ISBI	2007	DBLP DOI BibTeX RDF
1	Tunc Ikikardes, Markus Hofbauer, August Kaelin, Martin May	A Robust, Responsive, Distributed Tree-Based Routing Algorithm Guaranteeing N Valid Links per Node in Wireless Ad-Hoc Networks.	ISCC	2007	DBLP DOI BibTeX RDF
1	Jaechoon Chon, Takashi Fuse, Eihan Shimizu, Ryosuke Shibasaki	Three-Dimensional Image Mosaicking Using Multiple Projection Planes for 3-D Visualization of Roadside Standing Buildings.	IEEE Transactions on Systems, Man, and Cybernetics, Part B	2007	DBLP DOI BibTeX RDF
1	Edward P. F. Chan, Heechul Lim	Optimization and evaluation of shortest path queries.	VLDB J.	2007	DBLP DOI BibTeX RDF	Shortest path queries, Route queries, Query evaluation and optimization, Graph pruning, Disk-based algorithms, Graph algorithms
1	Daniel C. Lee	Proof of a modified Dijkstra's algorithm for computing shortest bundle delay in networks with deterministically time-varying links.	IEEE Communications Letters	2006	DBLP DOI BibTeX RDF
1	Leonid Khachiyan, Vladimir Gurvich, Jihui Zhao	Extending Dijkstra's Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction.	CSR	2006	DBLP DOI BibTeX RDF
1	Jon Sneyers, Tom Schrijvers, Bart Demoen	Dijkstra's Algorithm with Fibonacci Heaps: An Executable Description in CHR.	WLP	2006	DBLP BibTeX RDF
1	Hadda Cherroun, Alain Darte, Paul Feautrier	Scheduling under resource constraints using dis-equations.	DATE	2006	DBLP DOI BibTeX RDF
1	Mohammad Z. Siam, Marwan Krunz, Alaa Muqattash, Shuguang Cui	Adaptive multi-antenna power control in wireless networks.	IWCMC	2006	DBLP DOI BibTeX RDF	infrastructure-based networks, ad hoc networks, energy efficiency, IEEE 802.11, power control, MIMO, power-aware routing
1	Fulu Li, Kui Wu, Andrew Lippman	Energy-efficient cooperative routing in multi-hop wireless ad hoc networks.	IPCCC	2006	DBLP DOI BibTeX RDF
1	Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm	Partitioning Graphs to Speed Up Dijkstra's Algorithm.	WEA	2005	DBLP DOI BibTeX RDF
1	Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis	Geometric containers for efficient shortest-path computation.	ACM Journal of Experimental Algorithmics	2005	DBLP DOI BibTeX RDF	geometric container, shortest path, graph algorithms, Dijkstra's algorithm, traffic network, Data structures and algorithms
1	Khaled M. Fouad Elsayed	A framework for end-to-end deterministic-delay service provisioning in multiservice packet networks.	IEEE Transactions on Multimedia	2005	DBLP DOI BibTeX RDF
1	Sashka Davis, Russell Impagliazzo	Models of greedy algorithms for graph problems.	SODA	2004	DBLP DOI BibTeX RDF
1	Amarnath K. Koundinya, Atul Negi, V. N. Sastry	Unicast Routing Algorithm with Multiple Quality-of-Service Parameters.	ISPAN	2004	DBLP DOI BibTeX RDF
1	Joon-Sang Park, Michael Penner, Viktor K. Prasanna	Optimizing Graph Algorithms for Improved Cache Performance.	IEEE Trans. Parallel Distrib. Syst.	2004	DBLP DOI BibTeX RDF	Cache-friendly algorithms, shortest path, graph algorithms, minimum spanning trees, graph matching, algorithm performance, cache-oblivious algorithms, data layout optimizations
1	Enrique Mérida Casermeiro, José Muñoz-Pérez, Rafaela Benítez-Rochel	Neural Implementation of Dijkstra's Algorithm.	IWANN	2003	DBLP DOI BibTeX RDF
1	Shin-Jer Yang	Design issues and performance improvements in routing strategy on the internet workflow.	Int. Journal of Network Management	2003	DBLP DOI BibTeX RDF
1	Turgay Korkmaz, Marwan Krunz	Routing multimedia traffic with QoS guarantees.	IEEE Transactions on Multimedia	2003	DBLP DOI BibTeX RDF
1	George M. Adelson-Velsky, Eugene Levner	Project Scheduling in AND-OR Graphs: A Generalization of Dijkstra's Algorithm.	Math. Oper. Res.	2002	DBLP DOI BibTeX RDF
1	João L. Sobrinho	Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet.	IEEE/ACM Trans. Netw.	2002	DBLP DOI BibTeX RDF	quality of service, internet, Internet, routing, algebra
1	Shu Li, Rami G. Melhem, Taieb Znati	On the Performance of STAR: An Efficient Delay-Bound, Low-Cost Multicast Algorithm.	Annual Simulation Symposium	2002	DBLP DOI BibTeX RDF
1	Joon-Sang Park, Michael Penner, Viktor K. Prasanna	Optimizing Graph Algorithms for Improved Cache Performance. (PDF / PS)	IPDPS	2002	DBLP DOI BibTeX RDF
1	Nasir Shaikh-Husin, Mohamed Khalil Hani, Teoh Giap Seng	Implementation of Recurrent Neural Network Algorithm for Shortest Path Calculation in Network Routing. (PDF / PS)	ISPAN	2002	DBLP DOI BibTeX RDF	network routing, hardware implementation, Shortest path algorithm
1	Seth Pettie, Vijaya Ramachandran, Srinath Sridhar	Experimental Evaluation of a New Shortest Path Algorithm.	ALENEX	2002	DBLP DOI BibTeX RDF
1	Franck Hétroy, Dominique Attali	Topological Quadrangulations of Closed Triangulated Surfaces Using the Reeb Graph.	DGCI	2002	DBLP DOI BibTeX RDF
1	Christopher L. Barrett, Keith R. Bisset, Riko Jacob, Goran Konjevod, Madhav V. Marathe	Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router.	ESA	2002	DBLP DOI BibTeX RDF
1	René Beier, Peter Sanders, Naveen Sivadasan	Energy Optimal Routing in Radio Networks Using Geometric Data Structures.	ICALP	2002	DBLP DOI BibTeX RDF
1	Seth Pettie	A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs.	ICALP	2002	DBLP DOI BibTeX RDF
1	Seth Pettie	On the Comparison-Addition Complexity of All-Pairs Shortest Paths.	ISAAC	2002	DBLP DOI BibTeX RDF
1	Jayadev Misra	A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation.	Inf. Process. Lett.	2001	DBLP DOI BibTeX RDF
1	Muhammad Abaidullah Anwar, Takaichi Yoshida	Integrating OO road network database, cases and knowledge for route finding.	SAC	2001	DBLP DOI BibTeX RDF	must_be_passed link, knowledge-based techniques, road sub-network, case-based reasoning, Dijkstra's algorithm
1	Karsten Weihe	A software engineering perspective on algorithmics.	ACM Comput. Surv.	2001	DBLP DOI BibTeX RDF	algorithm engineering
1	Zheng Sun, John H. Reif	BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces.	ISAAC	2001	DBLP DOI BibTeX RDF
1	Shlomi Dolev, Ted Herman	Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments.	WSS	2001	DBLP DOI BibTeX RDF
1	Frank Schulz, Dorothea Wagner, Karsten Weihe	Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.	ACM Journal of Experimental Algorithmics	2000	DBLP DOI BibTeX RDF
1	Francis Lazarus, Anne Verroust	Level set diagrams of polyhedral objects.	Symposium on Solid Modeling and Applications	1999	DBLP DOI BibTeX RDF	Euler formula, cylindrical decomposition, skeleton, Dijkstra's algorithm
1	Mikkel Thorup	Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time.	J. ACM	1999	DBLP DOI BibTeX RDF	RAM algorithms, shortest paths
1	Jun Inagaki, Miki Haseyama, Hideo Kitajima	A genetic algorithm for determining multiple routes and its applications.	ISCAS	1999	DBLP DOI BibTeX RDF
1	Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson	Handling Global Conditions in Parameterized System Verification.	CAV	1999	DBLP DOI BibTeX RDF
1	Michael Barbehenn	A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices.	IEEE Trans. Computers	1998	DBLP DOI BibTeX RDF	data structures, Analysis of algorithms, combinatorial problems
1	Peter W. Eklund, S. D. Kirkby, Simon Pollitt	A dynamic multi-source Dijkstra's algorithm for vehicle routing.	ANZIIS	1996	DBLP DOI BibTeX RDF
1	Bing Liu 0001, Siew-Hwee Choo, Shee-Ling Lok, Sing-Meng Leong, Soo-Chee Lee, Foong-Ping Poon, Hwee-Har Tan	Finding the Shortest Route Using Cases, Knowledge, and Djikstra's Algorithm.	IEEE Expert	1994	DBLP DOI BibTeX RDF
1	Joseph S. B. Mitchell, Christos H. Papadimitriou	The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision.	J. ACM	1991	DBLP DOI BibTeX RDF	terrain navigation, weighted distance functions, shortest paths, Voronoi diagrams, Dijkstra's algorithm
1	Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert Endre Tarjan	Faster Algorithms for the Shortest Path Problem	J. ACM	1990	DBLP DOI BibTeX RDF
1	Donald E. Knuth	A Generalization of Dijkstra's Algorithm.	Inf. Process. Lett.	1977	DBLP DOI BibTeX RDF
1	Donald B. Johnson	A Note on Dijkstra's Shortest Path Algorithm.	J. ACM	1973	DBLP DOI BibTeX RDF