Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Shortest Paths). Showing records 1 – 30 of 34 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters

1. Pisaruk, Fabio. K-menores caminhos.

Degree: Mestrado, Ciência da Computação, 2009, University of São Paulo

Tratamos da generalização do problema da geração de caminho mínimo, no qual não apenas um, mas vários caminhos de menores custos devem ser produzidos. O… (more)

Subjects/Keywords: caminhos mínimos; k-menores caminhos; k-shortest paths; shortest paths

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pisaruk, F. (2009). K-menores caminhos. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-14072009-185725/ ;

Chicago Manual of Style (16th Edition):

Pisaruk, Fabio. “K-menores caminhos.” 2009. Masters Thesis, University of São Paulo. Accessed July 14, 2020. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-14072009-185725/ ;.

MLA Handbook (7th Edition):

Pisaruk, Fabio. “K-menores caminhos.” 2009. Web. 14 Jul 2020.

Vancouver:

Pisaruk F. K-menores caminhos. [Internet] [Masters thesis]. University of São Paulo; 2009. [cited 2020 Jul 14]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-14072009-185725/ ;.

Council of Science Editors:

Pisaruk F. K-menores caminhos. [Masters Thesis]. University of São Paulo; 2009. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-14072009-185725/ ;


University of New South Wales

2. Antsfeld, Leonid. Finding shortest paths in large scale networks.

Degree: National Information & Communication Technology Australia, 2014, University of New South Wales

 Finding the shortest path between two points in a network is a fundamental problem in computer science with manyapplications. By exploiting properties of the underlying… (more)

Subjects/Keywords: Grid networks; Shortest paths; Public transportation networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Antsfeld, L. (2014). Finding shortest paths in large scale networks. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/53850 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12554/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Antsfeld, Leonid. “Finding shortest paths in large scale networks.” 2014. Doctoral Dissertation, University of New South Wales. Accessed July 14, 2020. http://handle.unsw.edu.au/1959.4/53850 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12554/SOURCE02?view=true.

MLA Handbook (7th Edition):

Antsfeld, Leonid. “Finding shortest paths in large scale networks.” 2014. Web. 14 Jul 2020.

Vancouver:

Antsfeld L. Finding shortest paths in large scale networks. [Internet] [Doctoral dissertation]. University of New South Wales; 2014. [cited 2020 Jul 14]. Available from: http://handle.unsw.edu.au/1959.4/53850 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12554/SOURCE02?view=true.

Council of Science Editors:

Antsfeld L. Finding shortest paths in large scale networks. [Doctoral Dissertation]. University of New South Wales; 2014. Available from: http://handle.unsw.edu.au/1959.4/53850 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12554/SOURCE02?view=true


Penn State University

3. Shahid, Talal Ahmed. Path Recommendation for Road Networks.

Degree: MS, Computer Science and Engineering, 2009, Penn State University

 Finding paths (that can be driving directions, ight itineraries, etc.) from a source to a destination upon a spatial network is a common but non-trivial… (more)

Subjects/Keywords: Multicriteria paths; Road Networks; Path Search; K-shortest paths

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shahid, T. A. (2009). Path Recommendation for Road Networks. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/9631

Chicago Manual of Style (16th Edition):

Shahid, Talal Ahmed. “Path Recommendation for Road Networks.” 2009. Masters Thesis, Penn State University. Accessed July 14, 2020. https://etda.libraries.psu.edu/catalog/9631.

MLA Handbook (7th Edition):

Shahid, Talal Ahmed. “Path Recommendation for Road Networks.” 2009. Web. 14 Jul 2020.

Vancouver:

Shahid TA. Path Recommendation for Road Networks. [Internet] [Masters thesis]. Penn State University; 2009. [cited 2020 Jul 14]. Available from: https://etda.libraries.psu.edu/catalog/9631.

Council of Science Editors:

Shahid TA. Path Recommendation for Road Networks. [Masters Thesis]. Penn State University; 2009. Available from: https://etda.libraries.psu.edu/catalog/9631

4. Skrepetos, Dimitrios. Shortest Paths in Geometric Intersection Graphs.

Degree: 2018, University of Waterloo

 This thesis studies shortest paths in geometric intersection graphs, which can model, among others, ad-hoc communication and transportation networks. First, we consider two classical problems… (more)

Subjects/Keywords: shortest paths; unit-disk graphs; planar graphs; geometric intersection graphs; diameter

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Skrepetos, D. (2018). Shortest Paths in Geometric Intersection Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13454

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Skrepetos, Dimitrios. “Shortest Paths in Geometric Intersection Graphs.” 2018. Thesis, University of Waterloo. Accessed July 14, 2020. http://hdl.handle.net/10012/13454.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Skrepetos, Dimitrios. “Shortest Paths in Geometric Intersection Graphs.” 2018. Web. 14 Jul 2020.

Vancouver:

Skrepetos D. Shortest Paths in Geometric Intersection Graphs. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10012/13454.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Skrepetos D. Shortest Paths in Geometric Intersection Graphs. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13454

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

5. Medrano, Fernando Antonio. Corridor Location: Generating Competitive and Efficient Route Alternatives.

Degree: 2014, University of California – eScholarship, University of California

 The problem of transmission line corridor location can be considered, at best, a "wicked" public systems decision problem. It requires the consideration of numerous objectives… (more)

Subjects/Keywords: Geographic information science and geodesy; Computer science; Geography; combinatorial optimization; heuristics; multiobjective optimization; near shortest paths; parallel computing; shortest path algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Medrano, F. A. (2014). Corridor Location: Generating Competitive and Efficient Route Alternatives. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/4g92536t

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Medrano, Fernando Antonio. “Corridor Location: Generating Competitive and Efficient Route Alternatives.” 2014. Thesis, University of California – eScholarship, University of California. Accessed July 14, 2020. http://www.escholarship.org/uc/item/4g92536t.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Medrano, Fernando Antonio. “Corridor Location: Generating Competitive and Efficient Route Alternatives.” 2014. Web. 14 Jul 2020.

Vancouver:

Medrano FA. Corridor Location: Generating Competitive and Efficient Route Alternatives. [Internet] [Thesis]. University of California – eScholarship, University of California; 2014. [cited 2020 Jul 14]. Available from: http://www.escholarship.org/uc/item/4g92536t.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Medrano FA. Corridor Location: Generating Competitive and Efficient Route Alternatives. [Thesis]. University of California – eScholarship, University of California; 2014. Available from: http://www.escholarship.org/uc/item/4g92536t

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

6. Steiger, Alexander John. Single-face non-crossing shortest paths in planar graphs.

Degree: MS, Computer Science, 2017, University of Illinois – Urbana-Champaign

 We consider the following problem: Given an n-vertex undirected planar-embedded graph with a simple boundary cycle, non-negative edge lengths, and k pairs of terminals {(s_1,t_1),(s_2,t_2),...,(s_k,t_k)}… (more)

Subjects/Keywords: Planar graphs; Non-crossing paths; Shortest paths

…and one of its faces f such that the length of the shortest paths between a vertex on f and… …report the edges of shortest paths between such vertices in O(log log ∆) time per… …variant of Dijkstra’s algorithm [10] to compute shortest paths between two vertices in… …only if there exists non-crossing shortest paths in G connecting all pairs of terminals… …P3 of P j are shortest paths. It follows that P1 · P2 · P3 is a shortest s j -to- t j path… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Steiger, A. J. (2017). Single-face non-crossing shortest paths in planar graphs. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/98345

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Steiger, Alexander John. “Single-face non-crossing shortest paths in planar graphs.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed July 14, 2020. http://hdl.handle.net/2142/98345.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Steiger, Alexander John. “Single-face non-crossing shortest paths in planar graphs.” 2017. Web. 14 Jul 2020.

Vancouver:

Steiger AJ. Single-face non-crossing shortest paths in planar graphs. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2142/98345.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Steiger AJ. Single-face non-crossing shortest paths in planar graphs. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/98345

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade do Rio Grande do Sul

7. Souza, Marcelo de. Um método biobjetivo de alocação de tráfego para veículos convencionais e elétricos.

Degree: 2015, Universidade do Rio Grande do Sul

A busca de soluções para a mobilidade urbana que minimizem a agressão do setor de tráfego e transportes ao meio ambiente está cada vez maior.… (more)

Subjects/Keywords: Electric vehicles; Inteligência artificial; Traffic assignment; Informatica : Transportes; Shortest paths; Multi-objective optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Souza, M. d. (2015). Um método biobjetivo de alocação de tráfego para veículos convencionais e elétricos. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/130509

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Souza, Marcelo de. “Um método biobjetivo de alocação de tráfego para veículos convencionais e elétricos.” 2015. Thesis, Universidade do Rio Grande do Sul. Accessed July 14, 2020. http://hdl.handle.net/10183/130509.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Souza, Marcelo de. “Um método biobjetivo de alocação de tráfego para veículos convencionais e elétricos.” 2015. Web. 14 Jul 2020.

Vancouver:

Souza Md. Um método biobjetivo de alocação de tráfego para veículos convencionais e elétricos. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2015. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10183/130509.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Souza Md. Um método biobjetivo de alocação de tráfego para veículos convencionais e elétricos. [Thesis]. Universidade do Rio Grande do Sul; 2015. Available from: http://hdl.handle.net/10183/130509

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. Kiazyk, Stephen. The Star Unfolding from a Geodesic Curve.

Degree: 2014, University of Waterloo

 An unfolding of a polyhedron P is obtained by `cutting' the surface of P in such a way that it can be flattened into the… (more)

Subjects/Keywords: computational geometry; unfolding; shortest paths

…applied as a theoretical tool for the study of shortest paths constrained to the surface of a… …polyhedron. Unlike the general case of shortest paths in 3 dimensions with obstacles (which is… …NP-hard), the problem of shortest paths on a polyhedral surface is efficiently… …shortest paths on the surface of the polyhedron. A fundamental property is that when a shortest… …all shortest paths are laid out around the source point. 2 Figure 1.2: Star unfolding… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kiazyk, S. (2014). The Star Unfolding from a Geodesic Curve. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8935

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kiazyk, Stephen. “The Star Unfolding from a Geodesic Curve.” 2014. Thesis, University of Waterloo. Accessed July 14, 2020. http://hdl.handle.net/10012/8935.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kiazyk, Stephen. “The Star Unfolding from a Geodesic Curve.” 2014. Web. 14 Jul 2020.

Vancouver:

Kiazyk S. The Star Unfolding from a Geodesic Curve. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10012/8935.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kiazyk S. The Star Unfolding from a Geodesic Curve. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8935

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Melbourne

9. Smith, Olivia Jayne. Network problems in airline scheduling.

Degree: 2011, University of Melbourne

 Airline scheduling requires the solution of many interrelated problems which separately assign aircraft and crews to flights over different time scales. Solving these problems consecutively… (more)

Subjects/Keywords: constrained shortest paths; discrete optimisation; mixed integer programming; replenishment; column generation; Lagrangian relaxation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Smith, O. J. (2011). Network problems in airline scheduling. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/37169

Chicago Manual of Style (16th Edition):

Smith, Olivia Jayne. “Network problems in airline scheduling.” 2011. Doctoral Dissertation, University of Melbourne. Accessed July 14, 2020. http://hdl.handle.net/11343/37169.

MLA Handbook (7th Edition):

Smith, Olivia Jayne. “Network problems in airline scheduling.” 2011. Web. 14 Jul 2020.

Vancouver:

Smith OJ. Network problems in airline scheduling. [Internet] [Doctoral dissertation]. University of Melbourne; 2011. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11343/37169.

Council of Science Editors:

Smith OJ. Network problems in airline scheduling. [Doctoral Dissertation]. University of Melbourne; 2011. Available from: http://hdl.handle.net/11343/37169


University of Helsinki

10. Talvitie, Topi. Geometric kth shortest paths.

Degree: Department of Mathematics and Statistics; Helsingfors universitet, Matematisk-naturvetenskapliga fakulteten, Institutionen för matematik och statistik, 2015, University of Helsinki

 Finding shortest paths in planar domains bounded by polygons is a well-studied problem in computational geometry. However, in many applications, only finding the shortest path… (more)

Subjects/Keywords: computational geometry; locally shortest paths; route planning; Applied Mathematics; Soveltava matematiikka; Tillämpad matematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Talvitie, T. (2015). Geometric kth shortest paths. (Masters Thesis). University of Helsinki. Retrieved from http://hdl.handle.net/10138/158364

Chicago Manual of Style (16th Edition):

Talvitie, Topi. “Geometric kth shortest paths.” 2015. Masters Thesis, University of Helsinki. Accessed July 14, 2020. http://hdl.handle.net/10138/158364.

MLA Handbook (7th Edition):

Talvitie, Topi. “Geometric kth shortest paths.” 2015. Web. 14 Jul 2020.

Vancouver:

Talvitie T. Geometric kth shortest paths. [Internet] [Masters thesis]. University of Helsinki; 2015. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10138/158364.

Council of Science Editors:

Talvitie T. Geometric kth shortest paths. [Masters Thesis]. University of Helsinki; 2015. Available from: http://hdl.handle.net/10138/158364

11. Nagubadi, RadhaKrishna. K Shortest Path Implementation.

Degree: The Institute of Technology, 2013, Linköping UniversityLinköping University

  The problem of computing K shortest loopless paths, or ranking of the K shortest loopless paths between a pair of given vertices in a… (more)

Subjects/Keywords: K Shortest Path; Yen's; Shortest Path Algorithm; Deviation paths; K shortest loopless paths

…x29; AND (B) SET OF SHORTEST PATHS FROM 1 TO 0 IN G AS DEVIATION PATHS. ......4… …beneficial. The problem of computing more alternative paths than the best shortest path solution is… …said to be the K shortest path problem. The K shortest paths problem is an extension of the… …shortest path problem, which determines not only one shortest path but the K best shortest paths… …shortest paths, or ranking of the K shortest paths between a pair of given vertices in a network… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nagubadi, R. (2013). K Shortest Path Implementation. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-95451

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Nagubadi, RadhaKrishna. “K Shortest Path Implementation.” 2013. Thesis, Linköping UniversityLinköping University. Accessed July 14, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-95451.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Nagubadi, RadhaKrishna. “K Shortest Path Implementation.” 2013. Web. 14 Jul 2020.

Vancouver:

Nagubadi R. K Shortest Path Implementation. [Internet] [Thesis]. Linköping UniversityLinköping University; 2013. [cited 2020 Jul 14]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-95451.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nagubadi R. K Shortest Path Implementation. [Thesis]. Linköping UniversityLinköping University; 2013. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-95451

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Virginia Tech

12. Subramanian, Shivaram. Routing Algorithms for Dynamic, Intelligent Transportation Networks.

Degree: MS, Civil Engineering, 1997, Virginia Tech

 Traffic congestion has been cited as the most conspicuous problem in traffic management. It has far-reaching economic,social and political effects. Intelligent Transportation Systems (ITS) research… (more)

Subjects/Keywords: intelligent transportation systems; time-dependent; shortest paths; k-shortest; operations research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Subramanian, S. (1997). Routing Algorithms for Dynamic, Intelligent Transportation Networks. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/37056

Chicago Manual of Style (16th Edition):

Subramanian, Shivaram. “Routing Algorithms for Dynamic, Intelligent Transportation Networks.” 1997. Masters Thesis, Virginia Tech. Accessed July 14, 2020. http://hdl.handle.net/10919/37056.

MLA Handbook (7th Edition):

Subramanian, Shivaram. “Routing Algorithms for Dynamic, Intelligent Transportation Networks.” 1997. Web. 14 Jul 2020.

Vancouver:

Subramanian S. Routing Algorithms for Dynamic, Intelligent Transportation Networks. [Internet] [Masters thesis]. Virginia Tech; 1997. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10919/37056.

Council of Science Editors:

Subramanian S. Routing Algorithms for Dynamic, Intelligent Transportation Networks. [Masters Thesis]. Virginia Tech; 1997. Available from: http://hdl.handle.net/10919/37056


University of California – Irvine

13. Abdel-Salam, Gaby Hamdi. Active Travel, Built Environment and Transit Access: A Micro-Analysis of Pedestrian Travel Behavior.

Degree: Transportation Science, 2014, University of California – Irvine

 The introduction of Senate Bill (SB 375) in 2008 stimulated more research linking travel behavior to the built environment. Smart growth tools mandated by this… (more)

Subjects/Keywords: Transportation planning; Engineering; Active Travel; Built Environment; Multilevel Analysis; Segment-level; Shortest Paths; Transport-related Physical Activity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Abdel-Salam, G. H. (2014). Active Travel, Built Environment and Transit Access: A Micro-Analysis of Pedestrian Travel Behavior. (Thesis). University of California – Irvine. Retrieved from http://www.escholarship.org/uc/item/0187x0bn

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Abdel-Salam, Gaby Hamdi. “Active Travel, Built Environment and Transit Access: A Micro-Analysis of Pedestrian Travel Behavior.” 2014. Thesis, University of California – Irvine. Accessed July 14, 2020. http://www.escholarship.org/uc/item/0187x0bn.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Abdel-Salam, Gaby Hamdi. “Active Travel, Built Environment and Transit Access: A Micro-Analysis of Pedestrian Travel Behavior.” 2014. Web. 14 Jul 2020.

Vancouver:

Abdel-Salam GH. Active Travel, Built Environment and Transit Access: A Micro-Analysis of Pedestrian Travel Behavior. [Internet] [Thesis]. University of California – Irvine; 2014. [cited 2020 Jul 14]. Available from: http://www.escholarship.org/uc/item/0187x0bn.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Abdel-Salam GH. Active Travel, Built Environment and Transit Access: A Micro-Analysis of Pedestrian Travel Behavior. [Thesis]. University of California – Irvine; 2014. Available from: http://www.escholarship.org/uc/item/0187x0bn

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

14. Wagner, Mitchell James. Reconstructing Signaling Pathways Using Regular-Language Constrained Paths.

Degree: MS, Computer Science, 2018, Virginia Tech

 Signaling pathways are widely studied in systems biology. Several databases catalog our knowledge of these pathways, including the proteins and interactions that comprise them. However,… (more)

Subjects/Keywords: Regular Languages; Shortest Paths; Signaling Networks

…PCSF NetWalk TieDie RWR Shortcuts PathLinker Solution Class Network Flow Shortest Paths… …Random Walks Shortest Paths Shortest Paths Authors Yeger-Lotem et al. Yosef et al. Supper et… …terminal node, to the anchor (essentially, finding the shortest terminal-anchor paths for… …2.4. Shortest Paths They define an interactome G whose edges are weighted by probability… …conditions. 2.4 Shortest Paths Navlakha et al. [23] also look at shortest paths as a… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wagner, M. J. (2018). Reconstructing Signaling Pathways Using Regular-Language Constrained Paths. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/85044

Chicago Manual of Style (16th Edition):

Wagner, Mitchell James. “Reconstructing Signaling Pathways Using Regular-Language Constrained Paths.” 2018. Masters Thesis, Virginia Tech. Accessed July 14, 2020. http://hdl.handle.net/10919/85044.

MLA Handbook (7th Edition):

Wagner, Mitchell James. “Reconstructing Signaling Pathways Using Regular-Language Constrained Paths.” 2018. Web. 14 Jul 2020.

Vancouver:

Wagner MJ. Reconstructing Signaling Pathways Using Regular-Language Constrained Paths. [Internet] [Masters thesis]. Virginia Tech; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10919/85044.

Council of Science Editors:

Wagner MJ. Reconstructing Signaling Pathways Using Regular-Language Constrained Paths. [Masters Thesis]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/85044

15. Iglesias, Alexandre. Calcul d'itinéraire multicritère en transport multimodal : Multicriteria trip planning in multimodal transportation networks.

Degree: Docteur es, Informatique, 2017, Lyon

Les travaux effectués dans cette thèse industrielle concernent l'amélioration du calculateur d'itinéraire de Cityway, société spécialisée dans les technologies de l’information appliquées à la mobilité.Nous… (more)

Subjects/Keywords: Plus court chemin; Transport en commun; Multimodal; Multicritère; Shortest paths; Public transportation trip planner; Multimodal; Multicriteria

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Iglesias, A. (2017). Calcul d'itinéraire multicritère en transport multimodal : Multicriteria trip planning in multimodal transportation networks. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2017LYSEM025

Chicago Manual of Style (16th Edition):

Iglesias, Alexandre. “Calcul d'itinéraire multicritère en transport multimodal : Multicriteria trip planning in multimodal transportation networks.” 2017. Doctoral Dissertation, Lyon. Accessed July 14, 2020. http://www.theses.fr/2017LYSEM025.

MLA Handbook (7th Edition):

Iglesias, Alexandre. “Calcul d'itinéraire multicritère en transport multimodal : Multicriteria trip planning in multimodal transportation networks.” 2017. Web. 14 Jul 2020.

Vancouver:

Iglesias A. Calcul d'itinéraire multicritère en transport multimodal : Multicriteria trip planning in multimodal transportation networks. [Internet] [Doctoral dissertation]. Lyon; 2017. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2017LYSEM025.

Council of Science Editors:

Iglesias A. Calcul d'itinéraire multicritère en transport multimodal : Multicriteria trip planning in multimodal transportation networks. [Doctoral Dissertation]. Lyon; 2017. Available from: http://www.theses.fr/2017LYSEM025

16. Pathak, Vinayak. Reconfiguring Triangulations.

Degree: 2015, University of Waterloo

 The results in this thesis lie at the confluence of triangulations and reconfiguration. We make the observation that certain solved and unsolved problems about triangulations… (more)

Subjects/Keywords: triangulations; Boolean formulas; shortest paths; flipping; reconfiguration

shortest paths was NP-hard; it was later shown to be PSPACE-complete by Bonsma [12]. It… …was proved in the same paper [12] that reconfiguring between shortest paths in… …contribution is to initiate the study of the problem of computing the shortest reconfiguration paths… …for other problems, including vertex cover, coloring, maximum matching, shortest path… …other? We call this quantity the reconfiguration distance and this path the shortest… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pathak, V. (2015). Reconfiguring Triangulations. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9027

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Pathak, Vinayak. “Reconfiguring Triangulations.” 2015. Thesis, University of Waterloo. Accessed July 14, 2020. http://hdl.handle.net/10012/9027.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Pathak, Vinayak. “Reconfiguring Triangulations.” 2015. Web. 14 Jul 2020.

Vancouver:

Pathak V. Reconfiguring Triangulations. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10012/9027.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pathak V. Reconfiguring Triangulations. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9027

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Université Catholique de Louvain

17. Kivimäki, Ilkka. Distances, centralities and model estimation methods based on randomized shortest paths for network data analysis.

Degree: 2018, Université Catholique de Louvain

The emergence of networks and network data in different forms in the near past has given rise to development of new data analysis methods with… (more)

Subjects/Keywords: Graph-based data analysis; Randomized shortest paths; Data mining; Network science; Graph node centrality; Random walk; Model estimation; Graph node distance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kivimäki, I. (2018). Distances, centralities and model estimation methods based on randomized shortest paths for network data analysis. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/208413

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kivimäki, Ilkka. “Distances, centralities and model estimation methods based on randomized shortest paths for network data analysis.” 2018. Thesis, Université Catholique de Louvain. Accessed July 14, 2020. http://hdl.handle.net/2078.1/208413.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kivimäki, Ilkka. “Distances, centralities and model estimation methods based on randomized shortest paths for network data analysis.” 2018. Web. 14 Jul 2020.

Vancouver:

Kivimäki I. Distances, centralities and model estimation methods based on randomized shortest paths for network data analysis. [Internet] [Thesis]. Université Catholique de Louvain; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2078.1/208413.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kivimäki I. Distances, centralities and model estimation methods based on randomized shortest paths for network data analysis. [Thesis]. Université Catholique de Louvain; 2018. Available from: http://hdl.handle.net/2078.1/208413

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Université Catholique de Louvain

18. García Díez, Silvia. Randomized shortest paths and their applications.

Degree: 2015, Université Catholique de Louvain

In graph analysis, the Shortest Path problem identifies the optimal, most cost effective, path between two nodes. This problem has been the object of many… (more)

Subjects/Keywords: Music retrieval; Edit distance; Graph and network analysis; Machine learning; Path planning; Randomized shortest paths; Game theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

García Díez, S. (2015). Randomized shortest paths and their applications. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/165618

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

García Díez, Silvia. “Randomized shortest paths and their applications.” 2015. Thesis, Université Catholique de Louvain. Accessed July 14, 2020. http://hdl.handle.net/2078.1/165618.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

García Díez, Silvia. “Randomized shortest paths and their applications.” 2015. Web. 14 Jul 2020.

Vancouver:

García Díez S. Randomized shortest paths and their applications. [Internet] [Thesis]. Université Catholique de Louvain; 2015. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2078.1/165618.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

García Díez S. Randomized shortest paths and their applications. [Thesis]. Université Catholique de Louvain; 2015. Available from: http://hdl.handle.net/2078.1/165618

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

19. Delhome, Raphaël. Modélisation de la variabilité des temps de parcours et son intégration dans des algorithmes de recherche du plus court chemin stochastique : Travel time variability modeling and integration into stochastic shortest path problem algorithms.

Degree: Docteur es, Génie Civil, 2016, Lyon

 La représentation des temps de parcours est un enjeu influençant la qualité de l’information transmise aux usagers des réseaux de transport. En particulier, la congestion… (more)

Subjects/Keywords: Temps de parcours; Variabilité; Plus courts chemins; Accélération algorithmique; Travel times; Travel time variability; Shortest paths; Acceleration techniques

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Delhome, R. (2016). Modélisation de la variabilité des temps de parcours et son intégration dans des algorithmes de recherche du plus court chemin stochastique : Travel time variability modeling and integration into stochastic shortest path problem algorithms. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2016LYSET010

Chicago Manual of Style (16th Edition):

Delhome, Raphaël. “Modélisation de la variabilité des temps de parcours et son intégration dans des algorithmes de recherche du plus court chemin stochastique : Travel time variability modeling and integration into stochastic shortest path problem algorithms.” 2016. Doctoral Dissertation, Lyon. Accessed July 14, 2020. http://www.theses.fr/2016LYSET010.

MLA Handbook (7th Edition):

Delhome, Raphaël. “Modélisation de la variabilité des temps de parcours et son intégration dans des algorithmes de recherche du plus court chemin stochastique : Travel time variability modeling and integration into stochastic shortest path problem algorithms.” 2016. Web. 14 Jul 2020.

Vancouver:

Delhome R. Modélisation de la variabilité des temps de parcours et son intégration dans des algorithmes de recherche du plus court chemin stochastique : Travel time variability modeling and integration into stochastic shortest path problem algorithms. [Internet] [Doctoral dissertation]. Lyon; 2016. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2016LYSET010.

Council of Science Editors:

Delhome R. Modélisation de la variabilité des temps de parcours et son intégration dans des algorithmes de recherche du plus court chemin stochastique : Travel time variability modeling and integration into stochastic shortest path problem algorithms. [Doctoral Dissertation]. Lyon; 2016. Available from: http://www.theses.fr/2016LYSET010


Brock University

20. Motevallibashi, Nafiseh. Properties and Algorithms of the (n,k)-Arrangement Graphs and Augmented Cubes .

Degree: Department of Computer Science, Brock University

 The (n, k)-arrangement graph was first introduced in 1992 as a generalization of the star graph topology. Choosing an arrangement topology is more efficient in… (more)

Subjects/Keywords: augmented cubes; (n, k)-arrangement graph; disjoint shortest paths

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Motevallibashi, N. (n.d.). Properties and Algorithms of the (n,k)-Arrangement Graphs and Augmented Cubes . (Thesis). Brock University. Retrieved from http://hdl.handle.net/10464/13154

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Motevallibashi, Nafiseh. “Properties and Algorithms of the (n,k)-Arrangement Graphs and Augmented Cubes .” Thesis, Brock University. Accessed July 14, 2020. http://hdl.handle.net/10464/13154.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Motevallibashi, Nafiseh. “Properties and Algorithms of the (n,k)-Arrangement Graphs and Augmented Cubes .” Web. 14 Jul 2020.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Motevallibashi N. Properties and Algorithms of the (n,k)-Arrangement Graphs and Augmented Cubes . [Internet] [Thesis]. Brock University; [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10464/13154.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Motevallibashi N. Properties and Algorithms of the (n,k)-Arrangement Graphs and Augmented Cubes . [Thesis]. Brock University; Available from: http://hdl.handle.net/10464/13154

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

21. Takes, Frank Willem. Algorithms for analyzing and mining real-world graphs.

Degree: 2014, Leiden Institute of Advanced Computer Science (LIACS), Faculty of Science, Leiden University

 This thesis is about algorithms for analyzing large real-world graphs (or networks). Examples include (online) social networks, webgraphs, information networks, biological networks and scientific collaboration… (more)

Subjects/Keywords: Graphs; Algorithms; Networks; Social networks; Diameter; Distance; Shortest paths; Graphs; Algorithms; Networks; Social networks; Diameter; Distance; Shortest paths

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Takes, F. W. (2014). Algorithms for analyzing and mining real-world graphs. (Doctoral Dissertation). Leiden Institute of Advanced Computer Science (LIACS), Faculty of Science, Leiden University. Retrieved from http://hdl.handle.net/1887/29764

Chicago Manual of Style (16th Edition):

Takes, Frank Willem. “Algorithms for analyzing and mining real-world graphs.” 2014. Doctoral Dissertation, Leiden Institute of Advanced Computer Science (LIACS), Faculty of Science, Leiden University. Accessed July 14, 2020. http://hdl.handle.net/1887/29764.

MLA Handbook (7th Edition):

Takes, Frank Willem. “Algorithms for analyzing and mining real-world graphs.” 2014. Web. 14 Jul 2020.

Vancouver:

Takes FW. Algorithms for analyzing and mining real-world graphs. [Internet] [Doctoral dissertation]. Leiden Institute of Advanced Computer Science (LIACS), Faculty of Science, Leiden University; 2014. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1887/29764.

Council of Science Editors:

Takes FW. Algorithms for analyzing and mining real-world graphs. [Doctoral Dissertation]. Leiden Institute of Advanced Computer Science (LIACS), Faculty of Science, Leiden University; 2014. Available from: http://hdl.handle.net/1887/29764


Brno University of Technology

22. Krauter, Michal. Nejkratší cesty v grafu: Shortest Paths in a Graph.

Degree: 2019, Brno University of Technology

 This thesis deals with shortest paths problem in graphs. Shortest paths problem is the basic issue of graph theory with many pracitcal applications. We can… (more)

Subjects/Keywords: Nejkratší cesta; grafový algoritmus; nejkratší cesty mezi všemi vrcholy grafu; Dijkstrův algoritmus; Bellmanův-Fordův algoritmus; Floydův-Warshallův algoritmus.; Shortest paths; graph algorithms; single-source shortest path problem; all-paris shortest path problem; Dijkstra's algorithm; Bellman-Ford's algorithm; Floyd-Warshall's algorithm.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Krauter, M. (2019). Nejkratší cesty v grafu: Shortest Paths in a Graph. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53883

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Krauter, Michal. “Nejkratší cesty v grafu: Shortest Paths in a Graph.” 2019. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/53883.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Krauter, Michal. “Nejkratší cesty v grafu: Shortest Paths in a Graph.” 2019. Web. 14 Jul 2020.

Vancouver:

Krauter M. Nejkratší cesty v grafu: Shortest Paths in a Graph. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/53883.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Krauter M. Nejkratší cesty v grafu: Shortest Paths in a Graph. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/53883

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Université de Bordeaux I

23. Diot, Emilie. Etude structurelle et algorithmique des graphes pouvant être séparés avec des plus courts chemins : Structural and algorithmic studies of graphs can be separated using shortest paths.

Degree: Docteur es, Informatique, 2011, Université de Bordeaux I

Les graphes sont des objets couramment utilisés pour modéliser de nombreuses situations réelles comme des réseaux routiers, informatiques ou encore électriques. Ils permettent de résoudre… (more)

Subjects/Keywords: Graphes; Séparateurs; Routage compact; Plus courts chemins; Clôture par mineurs; NPcomplétude; Graphs; Separators; Compact routing; Shortest paths; Close under minors taking; NPcomplete

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Diot, E. (2011). Etude structurelle et algorithmique des graphes pouvant être séparés avec des plus courts chemins : Structural and algorithmic studies of graphs can be separated using shortest paths. (Doctoral Dissertation). Université de Bordeaux I. Retrieved from http://www.theses.fr/2011BOR14425

Chicago Manual of Style (16th Edition):

Diot, Emilie. “Etude structurelle et algorithmique des graphes pouvant être séparés avec des plus courts chemins : Structural and algorithmic studies of graphs can be separated using shortest paths.” 2011. Doctoral Dissertation, Université de Bordeaux I. Accessed July 14, 2020. http://www.theses.fr/2011BOR14425.

MLA Handbook (7th Edition):

Diot, Emilie. “Etude structurelle et algorithmique des graphes pouvant être séparés avec des plus courts chemins : Structural and algorithmic studies of graphs can be separated using shortest paths.” 2011. Web. 14 Jul 2020.

Vancouver:

Diot E. Etude structurelle et algorithmique des graphes pouvant être séparés avec des plus courts chemins : Structural and algorithmic studies of graphs can be separated using shortest paths. [Internet] [Doctoral dissertation]. Université de Bordeaux I; 2011. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2011BOR14425.

Council of Science Editors:

Diot E. Etude structurelle et algorithmique des graphes pouvant être séparés avec des plus courts chemins : Structural and algorithmic studies of graphs can be separated using shortest paths. [Doctoral Dissertation]. Université de Bordeaux I; 2011. Available from: http://www.theses.fr/2011BOR14425

24. Gueye, Fallou. Algorithmes de recherche d'itinéraires en transport multimodal : Shortest path Algorithms in multimodal transportation.

Degree: Docteur es, Systèmes industriels, 2010, Toulouse, INSA

Ce travail de thèse s’est intéressé au transport urbain de passagers dans un contexte d’offre de transport multimodale consistant en la coexistence de plusieurs modes… (more)

Subjects/Keywords: Plus court chemin; Chemins viables bi-objectif; Transport multimodal; Shortest path; Bi-objective viable paths; Multimodal transportation; 003

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gueye, F. (2010). Algorithmes de recherche d'itinéraires en transport multimodal : Shortest path Algorithms in multimodal transportation. (Doctoral Dissertation). Toulouse, INSA. Retrieved from http://www.theses.fr/2010ISAT0042

Chicago Manual of Style (16th Edition):

Gueye, Fallou. “Algorithmes de recherche d'itinéraires en transport multimodal : Shortest path Algorithms in multimodal transportation.” 2010. Doctoral Dissertation, Toulouse, INSA. Accessed July 14, 2020. http://www.theses.fr/2010ISAT0042.

MLA Handbook (7th Edition):

Gueye, Fallou. “Algorithmes de recherche d'itinéraires en transport multimodal : Shortest path Algorithms in multimodal transportation.” 2010. Web. 14 Jul 2020.

Vancouver:

Gueye F. Algorithmes de recherche d'itinéraires en transport multimodal : Shortest path Algorithms in multimodal transportation. [Internet] [Doctoral dissertation]. Toulouse, INSA; 2010. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2010ISAT0042.

Council of Science Editors:

Gueye F. Algorithmes de recherche d'itinéraires en transport multimodal : Shortest path Algorithms in multimodal transportation. [Doctoral Dissertation]. Toulouse, INSA; 2010. Available from: http://www.theses.fr/2010ISAT0042

25. Venkatraman, Ravi. Adaptive routing behavior with real time information under multiple travel objectives.

Degree: MSin Engineering, Civil Engineering, 2013, University of Texas – Austin

 Real time information about traffic conditions is becoming widely available through various media, and the focus on Advanced Traveler Information Systems (ATIS) is gaining importance… (more)

Subjects/Keywords: Adaptive routing; Real time information; Online shortest paths; Routing games; Driving behavior

…leads to a class of shortest path problems (SPP) called the online shortest paths… …Tsitsiklis [1996] developed a dynamic programming strategy to find shortest paths on a… …developed a label setting strategy to find the shortest paths when arc travel times were reset… …online shortest paths considered by Waller and Ziliaskopoulos [2002]. The TD-OSP… …interest to researchers for a long time. One of the first attempts at finding paths with minimum… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Venkatraman, R. (2013). Adaptive routing behavior with real time information under multiple travel objectives. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/22293

Chicago Manual of Style (16th Edition):

Venkatraman, Ravi. “Adaptive routing behavior with real time information under multiple travel objectives.” 2013. Masters Thesis, University of Texas – Austin. Accessed July 14, 2020. http://hdl.handle.net/2152/22293.

MLA Handbook (7th Edition):

Venkatraman, Ravi. “Adaptive routing behavior with real time information under multiple travel objectives.” 2013. Web. 14 Jul 2020.

Vancouver:

Venkatraman R. Adaptive routing behavior with real time information under multiple travel objectives. [Internet] [Masters thesis]. University of Texas – Austin; 2013. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2152/22293.

Council of Science Editors:

Venkatraman R. Adaptive routing behavior with real time information under multiple travel objectives. [Masters Thesis]. University of Texas – Austin; 2013. Available from: http://hdl.handle.net/2152/22293


Delft University of Technology

26. Planken, L.R. Algorithms for Simple Temporal Reasoning.

Degree: 2013, Delft University of Technology

 This dissertation describes research into new methods for automated temporal reasoning. For this purpose, several frameworks are available in literature. Chapter 1 presents a concise… (more)

Subjects/Keywords: computer science; algorithmics; artificial intelligence; scheduling; simple temporal problem; simple temporal network; shortest paths

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Planken, L. R. (2013). Algorithms for Simple Temporal Reasoning. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f ; urn:NBN:nl:ui:24-uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f ; urn:NBN:nl:ui:24-uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f ; http://resolver.tudelft.nl/uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f

Chicago Manual of Style (16th Edition):

Planken, L R. “Algorithms for Simple Temporal Reasoning.” 2013. Doctoral Dissertation, Delft University of Technology. Accessed July 14, 2020. http://resolver.tudelft.nl/uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f ; urn:NBN:nl:ui:24-uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f ; urn:NBN:nl:ui:24-uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f ; http://resolver.tudelft.nl/uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f.

MLA Handbook (7th Edition):

Planken, L R. “Algorithms for Simple Temporal Reasoning.” 2013. Web. 14 Jul 2020.

Vancouver:

Planken LR. Algorithms for Simple Temporal Reasoning. [Internet] [Doctoral dissertation]. Delft University of Technology; 2013. [cited 2020 Jul 14]. Available from: http://resolver.tudelft.nl/uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f ; urn:NBN:nl:ui:24-uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f ; urn:NBN:nl:ui:24-uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f ; http://resolver.tudelft.nl/uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f.

Council of Science Editors:

Planken LR. Algorithms for Simple Temporal Reasoning. [Doctoral Dissertation]. Delft University of Technology; 2013. Available from: http://resolver.tudelft.nl/uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f ; urn:NBN:nl:ui:24-uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f ; urn:NBN:nl:ui:24-uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f ; http://resolver.tudelft.nl/uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f


Delft University of Technology

27. Meier, J.M. The Relation Between Structure and Function in Brain Networks: A network science perspective.

Degree: 2017, Delft University of Technology

 Over the last two decades the field of network science has been evolving fast. Many useful applications in a wide variety of disciplines have been… (more)

Subjects/Keywords: structural brain networks; functional brain networks; effective connectivity; information flow; network motifs; shortest paths; epidemic spreading model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Meier, J. M. (2017). The Relation Between Structure and Function in Brain Networks: A network science perspective. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; 31b25b38-45e9-4469-810b-79fe19905a4d ; 10.4233/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:isbn:978-94-028-0638-0 ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d

Chicago Manual of Style (16th Edition):

Meier, J M. “The Relation Between Structure and Function in Brain Networks: A network science perspective.” 2017. Doctoral Dissertation, Delft University of Technology. Accessed July 14, 2020. http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; 31b25b38-45e9-4469-810b-79fe19905a4d ; 10.4233/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:isbn:978-94-028-0638-0 ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d.

MLA Handbook (7th Edition):

Meier, J M. “The Relation Between Structure and Function in Brain Networks: A network science perspective.” 2017. Web. 14 Jul 2020.

Vancouver:

Meier JM. The Relation Between Structure and Function in Brain Networks: A network science perspective. [Internet] [Doctoral dissertation]. Delft University of Technology; 2017. [cited 2020 Jul 14]. Available from: http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; 31b25b38-45e9-4469-810b-79fe19905a4d ; 10.4233/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:isbn:978-94-028-0638-0 ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d.

Council of Science Editors:

Meier JM. The Relation Between Structure and Function in Brain Networks: A network science perspective. [Doctoral Dissertation]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; 31b25b38-45e9-4469-810b-79fe19905a4d ; 10.4233/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:isbn:978-94-028-0638-0 ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d


Georgia Tech

28. Garcia, Renan. Resource constrained shortest paths and extensions.

Degree: PhD, Industrial and Systems Engineering, 2009, Georgia Tech

 In this thesis, we use integer programming techniques to solve the resource constrained shortest path problem (RCSPP) which seeks a minimum cost path between two… (more)

Subjects/Keywords: Dial-a-flight problem; Valid inequalities; Branch and cut; Integer programming; Constrained shortest paths; Integer programming; Combinatorial optimization; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Garcia, R. (2009). Resource constrained shortest paths and extensions. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/28268

Chicago Manual of Style (16th Edition):

Garcia, Renan. “Resource constrained shortest paths and extensions.” 2009. Doctoral Dissertation, Georgia Tech. Accessed July 14, 2020. http://hdl.handle.net/1853/28268.

MLA Handbook (7th Edition):

Garcia, Renan. “Resource constrained shortest paths and extensions.” 2009. Web. 14 Jul 2020.

Vancouver:

Garcia R. Resource constrained shortest paths and extensions. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1853/28268.

Council of Science Editors:

Garcia R. Resource constrained shortest paths and extensions. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/28268


Brno University of Technology

29. Molek, Martin. Generování protipříkladů při analýze Markovových modelů: Counter-Example Generation in the Analysis of Markov Models.

Degree: 2018, Brno University of Technology

 This thesis deals with generating counterexamples in context of probabilistic models. Counterexamples are generated for Markov models (specifically DTMC). Definitions of model properties are given… (more)

Subjects/Keywords: formální verifikace; protipříklady; Markovovy modely; pravděpodobnostní modely; DTMC; k-nejkratších cest; pravděpodobnostní temporální logika; STORM; formal verification; counterexamples; Markov chains; probabilistic models; DTMC; k-shortest paths; Probabilistic Computation Tree Logic; STORM

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Molek, M. (2018). Generování protipříkladů při analýze Markovových modelů: Counter-Example Generation in the Analysis of Markov Models. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/85148

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Molek, Martin. “Generování protipříkladů při analýze Markovových modelů: Counter-Example Generation in the Analysis of Markov Models.” 2018. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/85148.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Molek, Martin. “Generování protipříkladů při analýze Markovových modelů: Counter-Example Generation in the Analysis of Markov Models.” 2018. Web. 14 Jul 2020.

Vancouver:

Molek M. Generování protipříkladů při analýze Markovových modelů: Counter-Example Generation in the Analysis of Markov Models. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/85148.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Molek M. Generování protipříkladů při analýze Markovových modelů: Counter-Example Generation in the Analysis of Markov Models. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/85148

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

30. Sharma, Abhishek. High throughput path selection for unstructured data center networks.

Degree: MS, 0112, 2013, University of Illinois – Urbana-Champaign

 The increase in demand and popularity of cloud and big data applications has driven the need for higher throughput data center network design. Recent work… (more)

Subjects/Keywords: Data Center; Multipath Transmission Control Protocol (MPTCP); Jellyfish; Shortest Paths; Disjoint Paths; Throughput; Random Regular Graph (RRG); Random Permutation Matrix; Switches; Servers; Ports; Network Density

shortest paths, flow is sent through an arbitrary link a - b if path length of x - a + path… …equal to shortest path + 4, all paths of length equal to shortest path, k-shortest paths where… …all paths of length greater than equal to shortest path + 4 gives us the approximately… …would like to clarify that k-shortest paths refers to the first k shortest paths. For a… …sourcedestination pair, this may include paths whose lengths are longer than the shortest path length… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sharma, A. (2013). High throughput path selection for unstructured data center networks. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/45451

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sharma, Abhishek. “High throughput path selection for unstructured data center networks.” 2013. Thesis, University of Illinois – Urbana-Champaign. Accessed July 14, 2020. http://hdl.handle.net/2142/45451.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sharma, Abhishek. “High throughput path selection for unstructured data center networks.” 2013. Web. 14 Jul 2020.

Vancouver:

Sharma A. High throughput path selection for unstructured data center networks. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2142/45451.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sharma A. High throughput path selection for unstructured data center networks. [Thesis]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/45451

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2]

.