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:(Ford Fulkerson algorithm). Showing records 1 – 6 of 6 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Georgia Tech

1. Li, Jiaheng. Numerical estimates for arm exponents and the acceptance profile in two-dimensional invasion percolation.

Degree: MS, Mathematics, 2020, Georgia Tech

 The main object of this thesis is to numerically estimate some conjectured arm exponents when there exist a number of open paths and closed dual… (more)

Subjects/Keywords: Percolation; Critical percolation; Invasion percolation; Ford-Fulkerson algorithm; Regression

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, J. (2020). Numerical estimates for arm exponents and the acceptance profile in two-dimensional invasion percolation. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62823

Chicago Manual of Style (16th Edition):

Li, Jiaheng. “Numerical estimates for arm exponents and the acceptance profile in two-dimensional invasion percolation.” 2020. Masters Thesis, Georgia Tech. Accessed November 30, 2020. http://hdl.handle.net/1853/62823.

MLA Handbook (7th Edition):

Li, Jiaheng. “Numerical estimates for arm exponents and the acceptance profile in two-dimensional invasion percolation.” 2020. Web. 30 Nov 2020.

Vancouver:

Li J. Numerical estimates for arm exponents and the acceptance profile in two-dimensional invasion percolation. [Internet] [Masters thesis]. Georgia Tech; 2020. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1853/62823.

Council of Science Editors:

Li J. Numerical estimates for arm exponents and the acceptance profile in two-dimensional invasion percolation. [Masters Thesis]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/62823


Brno University of Technology

2. Makovský, Benjamin. Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm.

Degree: 2020, Brno University of Technology

 This work describes the design of the graphic implementation of the Ford-Fulkerson Algorithm for searching the maximum flow and the minimal cut in the network.… (more)

Subjects/Keywords: Graf; vrchol; hrana; síť; maximální tok; minimální řez; Ford-Fulkersonův algoritmus; Java applet.; Graph; node; edge; network; maximum flow; minimum cut; Ford-Fulkerson Algorithm; Java applet.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Makovský, B. (2020). Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/187853

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):

Makovský, Benjamin. “Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm.” 2020. Thesis, Brno University of Technology. Accessed November 30, 2020. http://hdl.handle.net/11012/187853.

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

MLA Handbook (7th Edition):

Makovský, Benjamin. “Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm.” 2020. Web. 30 Nov 2020.

Vancouver:

Makovský B. Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/11012/187853.

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

Council of Science Editors:

Makovský B. Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/187853

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


Brno University of Technology

3. Makovský, Benjamin. Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm.

Degree: 2019, Brno University of Technology

 This work describes the design of the graphic implementation of the Ford-Fulkerson Algorithm for searching the maximum flow and the minimal cut in the network.… (more)

Subjects/Keywords: Graf; vrchol; hrana; síť; maximální tok; minimální řez; Ford-Fulkersonův algoritmus; Java applet.; Graph; node; edge; network; maximum flow; minimum cut; Ford-Fulkerson Algorithm; Java applet.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Makovský, B. (2019). Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/56213

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):

Makovský, Benjamin. “Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm.” 2019. Thesis, Brno University of Technology. Accessed November 30, 2020. http://hdl.handle.net/11012/56213.

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

MLA Handbook (7th Edition):

Makovský, Benjamin. “Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm.” 2019. Web. 30 Nov 2020.

Vancouver:

Makovský B. Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/11012/56213.

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

Council of Science Editors:

Makovský B. Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/56213

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


Brno University of Technology

4. Kodym, Oldřich. Segmentace hipokampu v MRI datech: Segmentation of hippocampus in MRI data.

Degree: 2018, Brno University of Technology

 The thesis deals with application of graph-based methods in segmentation of low contrast image data, specifically hippocampus segmentation from magnetic resonance data. Firstly, basics and… (more)

Subjects/Keywords: Teorie grafů; Řez grafem; Min-cut/Max-flow teorém; Ford-Fulkersonův algoritmus; Segmentace hipokampu; Graph theory; Graph cut; Min-cut/Max-flow theorem; Ford-Fulkerson algorithm; Hippocampus segmentation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kodym, O. (2018). Segmentace hipokampu v MRI datech: Segmentation of hippocampus in MRI data. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/40740

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):

Kodym, Oldřich. “Segmentace hipokampu v MRI datech: Segmentation of hippocampus in MRI data.” 2018. Thesis, Brno University of Technology. Accessed November 30, 2020. http://hdl.handle.net/11012/40740.

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

MLA Handbook (7th Edition):

Kodym, Oldřich. “Segmentace hipokampu v MRI datech: Segmentation of hippocampus in MRI data.” 2018. Web. 30 Nov 2020.

Vancouver:

Kodym O. Segmentace hipokampu v MRI datech: Segmentation of hippocampus in MRI data. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/11012/40740.

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

Council of Science Editors:

Kodym O. Segmentace hipokampu v MRI datech: Segmentation of hippocampus in MRI data. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/40740

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


Brno University of Technology

5. Galanská, Katarína. Demonstrace vybraných grafových algoritmů: Demonstration of Selected Graph Algorithms.

Degree: 2019, Brno University of Technology

 This thesis deals with re-architecture of an existing application for the demonstration and visualization of selected graph algorithms. The goal of this thesis is to… (more)

Subjects/Keywords: grafy; grafové algoritmy; MST; Primov algoritmus; Kruskalov algoritmus; Hierholzerov algorithmus; Eulerov ťah; Ford-Fulkersonova metoda; Edmond Karpov algoritmus; OSGi; modularizácia; rozšíriteľnosť; OSGi služby; viacjazyčnosť aplikácie; graphs; graph algorithms; MST; Prim's algorithm; Kruskal's algorithm; Hierholzer's algorithm; Euler path; Ford-Fulkerson method; Edmond-Karp algorithm; OSGi; extensibility; OSGi services; multi-language application

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Galanská, K. (2019). Demonstrace vybraných grafových algoritmů: Demonstration of Selected Graph Algorithms. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/85091

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):

Galanská, Katarína. “Demonstrace vybraných grafových algoritmů: Demonstration of Selected Graph Algorithms.” 2019. Thesis, Brno University of Technology. Accessed November 30, 2020. http://hdl.handle.net/11012/85091.

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

MLA Handbook (7th Edition):

Galanská, Katarína. “Demonstrace vybraných grafových algoritmů: Demonstration of Selected Graph Algorithms.” 2019. Web. 30 Nov 2020.

Vancouver:

Galanská K. Demonstrace vybraných grafových algoritmů: Demonstration of Selected Graph Algorithms. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/11012/85091.

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

Council of Science Editors:

Galanská K. Demonstrace vybraných grafových algoritmů: Demonstration of Selected Graph Algorithms. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/85091

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

6. Xiong, Xin. Efficient Jacobian Determination by Structure-Revealing Automatic Differentiation.

Degree: 2014, University of Waterloo

 This thesis is concerned with the efficient computation of Jacobian matrices of nonlinear vector maps using automatic differentiation (AD). Specifically, we propose the use of… (more)

Subjects/Keywords: Automatic differentiation; Forward mode; Reverse mode; Directed acyclic graph; Computational graph; Directed edge separator; Jacobian matrix; Newton step; Minimum cutset; Ford-Fulkerson algorithm; Sparsity technique; Hidden structure

…Performance of Ford-Fulkerson algorithm on Fk . . . . . . . . . . . . . . . 18 3.4 Obtained… …the Ford-Fulkerson (FF) algorithm [22], a well known max-flow/min-cut… …algorithm. The Ford-Fulkerson algorithm finds the minimum s − t cut, a set of edges whose removal… …simplicity, in the numerical experiments we use the original Ford-Fulkerson algorithm to find the… …weights are determined, the Ford-Fulkerson algorithm can be applied and edge separators can be… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xiong, X. (2014). Efficient Jacobian Determination by Structure-Revealing Automatic Differentiation. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8197

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):

Xiong, Xin. “Efficient Jacobian Determination by Structure-Revealing Automatic Differentiation.” 2014. Thesis, University of Waterloo. Accessed November 30, 2020. http://hdl.handle.net/10012/8197.

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

MLA Handbook (7th Edition):

Xiong, Xin. “Efficient Jacobian Determination by Structure-Revealing Automatic Differentiation.” 2014. Web. 30 Nov 2020.

Vancouver:

Xiong X. Efficient Jacobian Determination by Structure-Revealing Automatic Differentiation. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10012/8197.

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

Council of Science Editors:

Xiong X. Efficient Jacobian Determination by Structure-Revealing Automatic Differentiation. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8197

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

.