The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase shortest-paths (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1968-1974 (16) 1975-1981 (20) 1982-1985 (18) 1986-1987 (20) 1988-1989 (22) 1990 (18) 1991 (19) 1992 (19) 1993 (35) 1994 (20) 1995 (31) 1996 (28) 1997 (36) 1998 (28) 1999 (30) 2000 (44) 2001 (44) 2002 (48) 2003 (65) 2004 (91) 2005 (70) 2006 (89) 2007 (89) 2008 (101) 2009 (84) 2010 (63) 2011 (54) 2012 (52) 2013 (60) 2014 (56) 2015 (49) 2016 (67) 2017 (50) 2018 (69) 2019 (61) 2020 (77) 2021 (80) 2022 (66) 2023 (63) 2024 (16)
Publication types (Num. hits)
article(842) book(3) incollection(29) inproceedings(1071) phdthesis(23)
Venues (Conferences, Journals, ...)
CoRR(226) SODA(80) FOCS(45) STOC(42) ESA(37) SIAM J. Comput.(37) Algorithmica(34) SCG(30) J. ACM(26) ICALP(23) Theor. Comput. Sci.(23) Networks(22) STACS(22) Inf. Process. Lett.(21) ISAAC(21) PODC(19) More (+10 of total 597)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 981 occurrences of 527 keywords

Results
Found 1968 publication records. Showing 1968 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
111Surender Baswana, Ramesh Hariharan, Sandeep Sen Maintaining all-pairs approximate shortest paths under deletion of edges. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  BibTeX  RDF
73Jason J. Holdsworth, Siu Man Lui GPS-enabled mobiles for learning shortest paths: a pilot study. Search on Bibsonomy FDG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF GPS-enabled mobile phones, mobile learning, problem-based learning, shortest paths algorithm
73Yanghua Xiao, Wentao Wu 0001, Jian Pei, Wei Wang 0009, Zhenying He Efficiently indexing shortest paths by exploiting symmetry in graphs. Search on Bibsonomy EDBT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
70Joseph S. B. Mitchell, Christos H. Papadimitriou The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision. Search on Bibsonomy J. ACM The full citation details ... 1991 DBLP  DOI  BibTeX  RDF terrain navigation, weighted distance functions, shortest paths, Voronoi diagrams, Dijkstra's algorithm
68Yakir Berchenko, Mina Teicher Graph Embedding through Random Walk for Shortest Paths Problems. Search on Bibsonomy SAGA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Graph embedding, shortest paths problem
67Gábor Rétvári, József Bíró, Tibor Cinkler On shortest path representation. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF linear programming, traffic engineering, shortest path routing
64Gábor Rétvári, József Bíró, Tibor Cinkler On Improving the Accuracy of OSPF Traffic Engineering. Search on Bibsonomy Networking The full citation details ... 2006 DBLP  DOI  BibTeX  RDF linear programming, shortest paths, traffic engineering, OSPF
63Hanan Samet, Jagan Sankaranarayanan, Houman Alborzi Scalable network distance browsing in spatial databases. Search on Bibsonomy SIGMOD Conference The full citation details ... 2008 DBLP  DOI  BibTeX  RDF shortest path quadtree, scalability, nearest neighbor, decoupling, spatial networks
63Michael Elkin Computing almost shortest paths. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF almost shortest paths, Graph algorithms, spanners
62Liam Roditty, Asaf Shapira All-Pairs Shortest Paths with a Sublinear Additive Error. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
62Gábor Rétvári, Róbert Szabó, József Bíró On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity. Search on Bibsonomy NETWORKING The full citation details ... 2004 DBLP  DOI  BibTeX  RDF routing, linear programming, Traffic engineering, OSPF
62John Hershberger 0001, Subhash Suri Efficient Computation of Euclidean Shortest Paths in the Plane Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF plane computational geometry, polygonal obstacles, shortest paths, time complexity, Euclidean shortest paths, efficient computation, worst-case time
62Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling Acceleration of Shortest Path and Constrained Shortest Path Computation. Search on Bibsonomy WEA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
61Mikkel Thorup Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. Search on Bibsonomy J. ACM The full citation details ... 1999 DBLP  DOI  BibTeX  RDF RAM algorithms, shortest paths
60Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. Search on Bibsonomy WINE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Network Pricing Games, Communication Networks, Stackelberg Games, Shortest Paths Tree
59Liam Roditty, Uri Zwick On Dynamic Shortest Paths Problems. Search on Bibsonomy ESA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
57Betsy George, Sangho Kim 0001, Shashi Shekhar Spatio-temporal Network Databases and Routing Algorithms: A Summary of Results. Search on Bibsonomy SSTD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF time-aggregated graphs, spatio-temporal data bases, shortest paths
57Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan Multi-Dimensional Interval Routing Schemes. Search on Bibsonomy WDAG The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Compact Routing Methods, Interval Routing Schemes, Interconnection Networks, Shortest Paths, Dimensions
57Youngseok Lee 0002, Biswanath Mukherjee A Traffic Engineering-Aware Shortest-Path Routing Algorithm in IP Networks. Search on Bibsonomy NETWORKING The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Simulations, Optimization, IP, Traffic engineering, ILP, Shortest-path routing
56Shigang Chen, Meongchul Song, Sartaj Sahni Two techniques for fast computation of constrained shortest paths. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF approximation algorithms, QoS routing, constrained shortest paths
56Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni Dynamic Multi-level Overlay Graphs for Shortest Paths. Search on Bibsonomy Math. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Shortest paths algorithms, speed-up techniques
56Luciano Gualà, Guido Proietti Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem. Search on Bibsonomy Euro-Par The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Equilibria in Distributed Systems, Single-Source Shortest Paths Tree, Algorithmic Mechanism Design, Selfish Agents, Truthful Mechanisms
56Camil Demetrescu, Giuseppe F. Italiano A new approach to dynamic all pairs shortest paths. Search on Bibsonomy J. ACM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF shortest paths, Dynamic graph algorithms
56Camil Demetrescu, Giuseppe F. Italiano A new approach to dynamic all pairs shortest paths. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF shortest paths, dynamic graph algorithms
56Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor E. Shparlinski On Routing in Circulant Graphs. Search on Bibsonomy COCOON The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Shortest paths, Lattices, Diameter, Loops, Circulant graphs
54Sudip Misra, B. John Oommen Stochastic Learning Automata-Based Dynamic Algorithms for the Single Source Shortest Path Problem. Search on Bibsonomy IEA/AIE The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Intelligent Systems, Learning Automata, Dynamic Shortest Paths
54Cees Duin A Branch-Checking Algorithm for All-Pairs Shortest Paths. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Dynamic programming, Shortest path, Shortest path tree
54Micha Sharir, Avikam Baltsan On Shortest Paths Amidst Convex Polyhedra. Search on Bibsonomy SCG The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
54M. G. Karunambigai, Parvathi Rangasamy, Krassimir T. Atanassov, N. Palaniappan An Intuitionistic Fuzzy Graph Method for Finding the Shortest Paths in Networks. Search on Bibsonomy IFSA (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Index Matrix (IM), Intuitionistic Fuzzy Graphs (IFGs), Dynamic programming (DP), Shortest path
54Liam Roditty, Uri Zwick Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
53Matthias Müller-Hannemann, Karsten Weihe Pareto Shortest Paths is Often Feasible in Practice. Search on Bibsonomy WAE The full citation details ... 2001 DBLP  DOI  BibTeX  RDF railway networks, shortest paths, Multi-criteria optimization, Pareto set
52Betsy George, Shashi Shekhar Time-Aggregated Graphs for Modeling Spatio-temporal Networks. Search on Bibsonomy J. Data Semantics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF time-aggregated graphs, spatio-temporal data- bases, location based services, shortest paths
52Ammar W. Mohemmed, Nirod Chandra Sahoo, Tan Kim Geok A new particle swarm optimization based algorithm for solving shortest-paths tree problem. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
52Sudip Misra, B. John Oommen An Efficient Dynamic Algorithm for Maintaining All-Pairs Shortest Paths in Stochastic Networks. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2006 DBLP  DOI  BibTeX  RDF stochastic graphs, Routing, dynamic, learning automata, all pairs shortest path
52Joseph S. B. Mitchell, Micha Sharir New results on shortest paths in three dimensions. Search on Bibsonomy SCG The full citation details ... 2004 DBLP  DOI  BibTeX  RDF shortest path, NP-hardness, motion planning, terrain
52Víctor M. Jiménez, Andrés Marzal A Lazy Version of Eppstein's K Shortest Paths Algorithm. Search on Bibsonomy WEA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
52Surender Baswana, Ramesh Hariharan, Sandeep Sen Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF BFS tree, decremental, reachability
52Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack Approximating Shortest Paths on Weighted Polyhedral Surfaces. Search on Bibsonomy Algorithmica The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
52Jiefeng Cheng, Jeffrey Xu Yu On-line exact shortest distance query processing. Search on Bibsonomy EDBT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
52Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack Shortest Anisotropic Paths on Terrains. Search on Bibsonomy ICALP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF aniositropic paths, computational geometry, approximation, shortest path
51Uri Zwick All pairs shortest paths using bridging sets and rectangular matrix multiplication. Search on Bibsonomy J. ACM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF shortest paths, Matrix multiplication
51Uri Zwick All Pairs Shortest Paths in Weighted Directed Graphs ¾ Exact and Almost Exact Algorithms. Search on Bibsonomy FOCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Bridging sets, Randomized algorithms, Shortest paths, Matrix multiplication
51Michael Elkin, Jian Zhang 0004 Efficient algorithms for constructing (1+, varepsilon;, beta)-spanners in the distributed and streaming models. Search on Bibsonomy PODC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF almost shortest paths, streaming model, spanner
51Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni Partially Dynamic Concurrent Update of Distributed Shortest Paths. Search on Bibsonomy ICCTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
51Valerie King Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs. Search on Bibsonomy FOCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
49Edith Cohen Polylog-time and near-linear work approximation scheme for undirected shortest paths. Search on Bibsonomy J. ACM The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
48Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick Reachability and distance queries via 2-hop labels. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  BibTeX  RDF
48Anna Nepomniaschaya Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph. Search on Bibsonomy PaCT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Directed weighted graph, subgraph of the shortest paths, decremental algorithm, associative parallel processor, access data by contents, adjacency matrix
48Timothy M. Chan All-Pairs Shortest Paths with Real Weights in O ( n 3/log n ) Time. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Shortest paths, Graph algorithms
48Emina I. Milovanovic, Igor Z. Milovanovic, Michael P. Bekakos, I. N. Tselepis Computing all-pairs shortest paths on a linear systolic array and hardware realization on a reprogrammable FPGA platform. Search on Bibsonomy J. Supercomput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF FPGA, Parallel computations, Systolic arrays, All-pairs shortest paths, Parallel iterative methods
48Luciano Gualà, Guido Proietti Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Single-source shortest paths tree, Algorithmic mechanism design, Selfish agents, Truthful mechanisms
48Gayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya A blocked all-pairs shortest-paths algorithm. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF cache, blocking, speedup, all pairs shortest paths
48Mikkel Thorup Integer priority queues with decrease key in constant time and the single source shortest paths problem. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Fibonacci heaps, single source shortest paths, priority queues
48Avi Shoshan, Uri Zwick All Pairs Shortest Paths in Undirected Graphs with Integer Weights. Search on Bibsonomy FOCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF shortest paths, graph algorithms, matrix multiplication
48Jean-Daniel Boissonnat, André Cérézo, Juliette Leblond Shortest paths of bounded curvature in the plane. Search on Bibsonomy J. Intell. Robotic Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF car-like robots, minimum principle of Pontryagin, optimal control, Motion planning, constrained shortest paths
48Sing-Ban Tien, Cauligi S. Raghavendra Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF n-dimensional hypercube, parallel algorithms, computational complexity, complexity, fault tolerant computing, shortest paths, hypercube networks, diameter, bounds, faulty hypercubes
47Matthias Kirschner, Philipp Schengbier, Tobias Tscheuschner Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games. Search on Bibsonomy SEA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF selfish step algorithm, network congestion games, game theory, shortest paths, Nash equilibria, speed-up techniques
47Jordi Castro 0001 A Fast Network Flows Heuristic for Cell Suppression in Positive Tables. Search on Bibsonomy Privacy in Statistical Databases The full citation details ... 2004 DBLP  DOI  BibTeX  RDF cell suppression problem, linear programming, shortest-paths, statistical disclosure control, network optimization
47Yinzhen Li, Ruichun He, Linzhong Liu, Yaohuang Guo Genetic Algorithms for Dissimilar Shortest Paths Based on Optimal Fuzzy Dissimilar Measure and Applications. Search on Bibsonomy FSKD (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
47Ran Duan, Seth Pettie Bounded-leg distance and reachability oracles. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
47Yuval Emek, David Peleg, Liam Roditty A near-linear time algorithm for computing replacement paths in planar directed graphs. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
46Meinolf Sellmann Cost-Based Filtering for Shorter Path Constraints. Search on Bibsonomy CP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF optimization constraints, relaxed consistency, constrained shortest paths, problem reduction
46Fang-Rong Hsu, Yaw-Ling Lin, Yin-Te Tsai Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs. Search on Bibsonomy ISAAC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
46Chiun-Chieh Hsu, Da-Ren Chen, Hua-Yuan Ding An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths. Search on Bibsonomy ICA3PP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Forbidden paths, Shortest paths, Network flows, Labeling algorithm
46Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack Determining approximate shortest paths on weighted polyhedral surfaces. Search on Bibsonomy J. ACM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF weighted paths, approximation algorithms, computational geometry, shortest path problems, Design and analysis of algorithms, polyhedral surfaces
46Philip N. Klein, Sairam Subramanian A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Minimum-cost path, Minimum-cost path, Shortest path, Shortest path, Graph algorithm, Graph algorithm, Planar graph, Planar graph, Key words, Dynamic algorithm, Dynamic algorithm
46Eric Ruppert Finding the k Shortest Paths in Parallel. Search on Bibsonomy STACS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Topics parallel algorithms, data structures
45Laxmi P. Gewali, Victor Roman Generalization of Shortest Path Map. Search on Bibsonomy ITNG The full citation details ... 2010 DBLP  DOI  BibTeX  RDF constrained shortest paths map, shortest paths, Path planning
45Shmuel Zaks On the Use of Duality and Geometry in Layouts for ATM Networks. Search on Bibsonomy MFCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
44Piet Van Mieghem, Huijuan Wang The observable part of a network. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF union of shortest paths, observability, overlay
44Tadao Takaoka Partial Solution and Entropy. Search on Bibsonomy MFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF adaptive sort, minimal mergesort, ascending runs, nearly acyclic graphs, complexity, entropy, shortest paths, minimum spanning trees
44Mikkel Thorup Undirected Single Source Shortest Path in Linear Time. Search on Bibsonomy FOCS The full citation details ... 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
44Yevgeny Schreiber, Micha Sharir An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Continuous Dijkstra, Polytope surface, Shortest path, Unfolding, Geodesics, Wavefront, Shortest path map
44Liam Roditty On the K-simple shortest paths problem in weighted directed graphs. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
44Yevgeny Schreiber, Micha Sharir An optimal-time algorithm for shortest paths on a convex polytope in three dimensions. Search on Bibsonomy SCG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF continuous Dijkstra, polytope surface, shortest path, unfolding, geodesics, wavefront, shortest path map
44Víctor M. Jiménez, Andrés Marzal Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison. Search on Bibsonomy WAE The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
44Hongchi Shi, Paul D. Gader, Hongzheng Li Parallel Mesh Algorithms for Grid Graph Shortest Paths with Application to Separation of Touching Chromosomes. Search on Bibsonomy J. Supercomput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF chromosome image segmentation, parallel algorithm, feature extraction, shortest path, mesh-connected computer, grid graph
43João L. Sobrinho Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF quality of service, internet, Internet, routing, algebra
42Michele Flammini, Giorgio Gambosi, Sandro Salomone Boolean Routing. Search on Bibsonomy WDAG The full citation details ... 1993 DBLP  DOI  BibTeX  RDF shortest paths representation, Distributed systems, NP-completeness, interval routing, compact routing tables
42Eddie Cheng 0001, Shuhong Gao, Ke Qiu 0001, Zhizhang Shen On Disjoint Shortest Paths Routing on the Hypercube. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
42Nighat Yasmin Incremental computation of shortest paths in semi-dynamic graphs using software components. Search on Bibsonomy ACM Southeast Regional Conference The full citation details ... 2006 DBLP  DOI  BibTeX  RDF semi-dynamic graphs, specification, shortest path, software component, incremental computation
42Rezaul Alam Chowdhury, Vijaya Ramachandran External-memory exact and approximate all-pairs shortest-paths in undirected graphs. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
42Sergei Bespamyatnikh Computing homotopic shortest paths in the plane. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  BibTeX  RDF
42John Hershberger 0001, Subhash Suri, Amit M. Bhosle On the Difficulty of Some Shortest Path Problems. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
42Matt Duckham, Lars Kulik "Simplest" Paths: Automated Route Selection for Navigation. Search on Bibsonomy COSIT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF instruction complexity, Navigation, shortest path, wayfinding, route selection
41Kranthi K. Mamidisetty, Minlan Duan, Shivakumar Sastry, P. S. Sastry Multipath Dissemination in Regular Mesh Topologies. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
41Jianxi Fan, Xiaola Lin, Xiaohua Jia Optimal Path Embedding in Crossed Cubes. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF optimal embedding, interconnection network, graph embedding, Crossed cube, parallel computing system
41Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong The stable paths problem and interdomain routing. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF path vector protocols, stable routing, BGP, Border Gateway Protocol, interdomain routing, internet routing
41Aaron Bernstein, David R. Karger A nearly optimal oracle for avoiding failed vertices and edges. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF shortest paths, sensitivity
41Jakob Krarup, Malene Nordlund Rørbech LP formulations of the shortest path tree problem. Search on Bibsonomy 4OR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF visualizing LP-duality, linear programming, Shortest paths
41Sudip Misra, B. John Oommen The Pursuit Automaton Approach for Estimating All-Pairs Shortest Paths in Dynamically Changing Networks. Search on Bibsonomy AINA Workshops (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
41Sudip Misra, B. John Oommen New Algorithms for Maintaining All-Pairs Shortest Paths. Search on Bibsonomy ISCC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
41Jindong Chen, Yijie Han Storing Shortest Paths for a Polyhedron. Search on Bibsonomy ICCI The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
41Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time. Search on Bibsonomy SCG The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
41Andrew Zalesky DT-MRI Fiber Tracking: A Shortest Paths Approach. Search on Bibsonomy IEEE Trans. Medical Imaging The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
41Yanzhi Li, Andrew Lim 0001, Hong Ma A Hybrid Genetic Algorithm for Solving the Length-Balanced Two Arc-Disjoint Shortest Paths Problem. Search on Bibsonomy IEA/AIE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF length-balanced, shortest path, Lagrangian relaxation
41Michael Elkin Computing almost shortest paths. Search on Bibsonomy PODC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
40Feng Lu 0004, Poh-Chin Lai A Shortest Path Algorithm Based on Limited Search Heuristics. Search on Bibsonomy CSR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF heuristic, road network, shortest path algorithm
40Jérôme Berclaz, François Fleuret, Engin Türetken, Pascal Fua Multiple Object Tracking Using K-Shortest Paths Optimization. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF multiobject tracking, linear programming, Data association, K-shortest paths
40Aaron Bernstein Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithms, shortest paths, graph algorithms, dynamic algorithms
Displaying result #1 - #100 of 1968 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license