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