Log in

Relevant bibliographies by topics / Shortest paths / Books

To see the other types of publications on this topic, follow the link: Shortest paths.

Books on the topic 'Shortest paths'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 books for your research on the topic 'Shortest paths.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse books on a wide variety of disciplines and organise your bibliography correctly.

1

Crisler, Nancy. Shortest paths. COMAP, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Li, Fajie, and Reinhard Klette. Euclidean Shortest Paths. Springer London, 2011. http://dx.doi.org/10.1007/978-1-4471-2256-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Icking, Christian. Shortest paths for line segments. Courant Institute of Mathematical Sciences, New York University, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Akman, Varol. Unobstructed Shortest Paths in Polyhedral Environments. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-17629-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Brandimarte, Paolo. From Shortest Paths to Reinforcement Learning. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61867-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Sharir, Micha. On shortest paths amidst convex polyhedra. Courant Institute of Mathematical Sciences, New York University, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Baltsan, Avikam. On shortest paths between two convex polyhedra. Courant Institute of Mathematical Sciences, New York University, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Reinhard, Klette, ed. Euclidean shortest paths: Exact or approximate algorithms. Springer-Verlag, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Cuerington, Andrè M. The shortest path problem in the plane with obstacles: Bounds on path lengths and shortest paths within homotopy classes. Naval Postgraduate School, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Crane, Jerry Allen. Searching for shortest and safest paths along obstacle common tangents. Naval Postgraduate School, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

11

Ruppert, Eric. Parallel algorithms for the k shortest paths and related problems. University of Toronto, Dept. of Computer Science, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

12

Wensheng, Liu. Shortest paths for sub-Riemannian metrics on rank-two distributions. American Mathematical Society, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

13

Adamatzky, Andrew, ed. Shortest Path Solvers. From Software to Wetware. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-77510-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Tipici, Z. R. Shortest path and minimum cost low algorithms. UMIST, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

15

Dunn, Christine E. Notes on shortest path algorithms for GIS. North West Regional Research Laboratory, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

16

1956-, Ahuja Ravindra K., and Sloan School of Management, eds. Faster algorithms for the shortest path problem. Sloan School of Management, Massachusetts Institute of Technology, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

17

Camil, Demetrescu, Goldberg Andrew V, and Johnson David S. 1945-, eds. The shortest path problem: Ninth DIMACS implementation challenge. American Mathematical Society, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

18

Young, Neal E. Faster parametric shortest path and minimum balance algorithms. Sloan School of Management, Massachusetts Institute of Technology, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

19

Allan, David. 802.1aq shortest path bridging design and evolution: The architects' perspective. Wiley, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

20

Anand, Sachin. Graph theory and algorithms:implementation of Dijkstra's shortest path algorithm in Java. Oxford Brookes University, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

21

Shing, Man-Tak. Persistence search -- a new search strategy for the dynamic shortest path problem. Naval Postgraduate School, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

22

Guibas, Leonidas J. Linear time algorithms for visibility and shortest path problems inside simple polygons. Courant Institute of Mathematical Sciences, New York University, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

23

Farhat, Idriss. Evaluation of shortest path algorithms for an application of the travelling salesman problem. Oxford Brookes University, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

24

Ahuja, Ravindra K. Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems. Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

25

Johnson, George. A shortcut through time: The path to a quantum computer. Alfred A. Knopf, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

26

Logan, Joseph. 7 simple steps to landing your first job: The shortest path from here to hired. Maytown Press, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

27

Moser, Tijmen Jan. The shortest path method for seismic ray tracing in complicated media =: De kortste-routemethode voor seismische raytracing in gecompliceerde media. Faculteit Aardwetenschappen der Rijksuniversiteit te Utrecht], 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

28

Jenkins, Kevin Dean. The shortest path problem in the plane with obstacles: A graph modeling approach to producing finite search lists of homotopy classes. Naval Postgraduate School, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

29

Willem Hippolyte Leopold Marie Pijls. Shortest paths and game trees. 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

30

Unobstructed shortest paths in polyhedral environments. Springer-Verlag, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

31

Akman, Varol. Unobstructed Shortest Paths in Polyhedral Environments. Springer, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

32

Schorr, Amir, and Micha Sharir. On Shortest Paths in Polyhedral Spaces. Creative Media Partners, LLC, 2018.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

33

Dynamic Algorithms for Shortest Paths and Matching. [publisher not identified], 2016.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

34

Baltsan, Avikam, and M. Sharir. On Shortest Paths Between Two Convex Polyhedra. Creative Media Partners, LLC, 2018.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

35

Klette, Reinhard, and Fajie Li. Euclidean Shortest Paths: Exact or Approximate Algorithms. Springer London, Limited, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

36

Klette, Reinhard, and Li Fajie. Euclidean Shortest Paths: Exact or Approximate Algorithms. Springer, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

37

Ziegelmann, Dr Mark. Constrained Shortest Paths and Related Problems: Constrained Network Optimization. VDM Verlag Dr. Müller, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

38

Newman, Mark. Computer algorithms. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198805090.003.0008.

Full text

Abstract:

This chapter introduces some of the fundamental concepts of numerical network calculations. The chapter starts with a discussion of basic concepts of computational complexity and data structures for storing network data, then progresses to the description and analysis of algorithms for a range of network calculations: breadth-first search and its use for calculating shortest paths, shortest distances, components, closeness, and betweenness; Dijkstra's algorithm for shortest paths and distances on weighted networks; and the augmenting path algorithm for calculating maximum flows, minimum cut se

APA, Harvard, Vancouver, ISO, and other styles

39

Brandimarte, Paolo. From Shortest Paths to Reinforcement Learning: A MATLAB-Based Tutorial on Dynamic Programming. Springer International Publishing AG, 2022.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

40

Brandimarte, Paolo. From Shortest Paths to Reinforcement Learning: A MATLAB-Based Tutorial on Dynamic Programming. Springer International Publishing AG, 2021.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

41

Shiffrar, Maggie, and Christina Joseph. Paths of Apparent Human Motion Follow Motor Constraints. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780199794607.003.0077.

Full text

Abstract:

The phenomenon of apparent motion, or the illusory perception of movement from rapidly displayed static images, provides an excellent platform for the study of how perceptual systems analyze input over time and space. Studies of the human body in apparent motion further suggest that the visual system is also influenced by an observer’s motor experience with his or her own body. As a result, the human visual system sometimes processes human movement differently from object movement. For example, under apparent motion conditions in which inanimate objects appear to traverse the shortest possible

APA, Harvard, Vancouver, ISO, and other styles

42

Ortega-Arranz, Hector, Diego R. Llanos, and Arturo Gonzalez-Escribano. Shortest Path Problem. Morgan & Claypool Publishers, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

43

The shortest path. FAO, 2021. http://dx.doi.org/10.4060/cb7278en.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Near Extensions and Alignment of Data in R^n: Whitney Extensions of near Isometries, Shortest Paths, Equidistribution, Clustering and Non-Rigid Alignment of Data in Euclidean Space. Wiley & Sons, Incorporated, John, 2023.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

45

Near Extensions and Alignment of Data in R^n: Whitney Extensions of near Isometries, Shortest Paths, Equidistribution, Clustering and Non-Rigid Alignment of Data in Euclidean Space. Wiley & Sons, Limited, John, 2023.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

46

Near Extensions and Alignment of Data in R^n: Whitney Extensions of near Isometries, Shortest Paths, Equidistribution, Clustering and Non-Rigid Alignment of Data in Euclidean Space. Wiley & Sons, Limited, John, 2023.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

47

Near Extensions and Alignment of Data in R^n: Whitney Extensions of near Isometries, Shortest Paths, Equidistribution, Clustering and Non-Rigid Alignment of Data in Euclidean Space. Wiley & Sons, Incorporated, John, 2023.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

48

Mann, Peter. Differential Equations. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198822370.003.0035.

Full text

Abstract:

This chapter presents the general formulation of the calculus of variations as applied to mechanics, relativity and field theories. The calculus of variations is a common mathematical technique used throughout classical mechanics. First developed by Euler to determine the shortest paths between fixed points along a surface, it was applied by Lagrange to mechanical problems in analytical mechanics. The variational problems in the chapter have been simplified for ease of understanding upon first introduction, in order to give a general mathematical framework. This chapter takes a relaxed approac

APA, Harvard, Vancouver, ISO, and other styles

49

Ya'alon, Moshe B. Longer, Shorter Path. Gefen Publishing House, Limited, 2020.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

50

Adamatzky, Andrew. Shortest Path Solvers. From Software to Wetware. Springer, 2019.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!