Search results
Jump to navigation
Jump to search
Page title matches
- 5 KB (732 words) - 09:07, 13 February 2016
- #REDIRECT [[Lecture: Efficient Graph Algorithms]]49 bytes (5 words) - 22:36, 13 October 2015
Page text matches
- A [[Basic graph definitions|directed graph]] <math>G=(V,A)</math>. == Known algorithms ==195 bytes (27 words) - 07:21, 3 November 2014
- # [[Basic graph definitions]] ...n and without loss of generality, we assume that <math>G</math> is [[Basic graph definitions|simple]].544 bytes (73 words) - 19:07, 9 November 2014
- # [[Basic graph definitions]] A [[Basic graph definitions|directed graph]] <math>G=(V,A)</math>.429 bytes (58 words) - 19:07, 9 November 2014
- # An [[Basic graph definitions#Directed and undirected graphs|undirected graph]] <math>G = (V,E)</math>, not necessarily connected. An [[Basic graph definitions#Forests, trees, branchings, arborescences|undirected tree]] <ma539 bytes (79 words) - 12:33, 16 June 2015
- # An [[Basic graph definitions#Directed and undirected graphs|undirected graph]] <math>G = (V,E)</math>, not necessarily connected. An [[Basic graph definitions#Forests, trees, branchings, arborescences|undirected forest]] <540 bytes (79 words) - 18:03, 18 September 2015
- #REDIRECT [[Lecture: Efficient Graph Algorithms]]49 bytes (5 words) - 22:36, 13 October 2015
- # [[Basic graph definitions]] # A directed graph <math>G=(V,A)</math>:689 bytes (107 words) - 07:53, 8 November 2015
- # [[Basic graph definitions]] Let <math>G=(V,A)</math> be a directed graph, let <math>s,t\in V</math>, and for each arc <math>a\in A</math> let <math>1 KB (189 words) - 19:06, 9 November 2014
- # [[Basic graph definitions]] # A [[Basic graph definitions|directed graph]] <math>G=(V,A)</math>.2 KB (314 words) - 19:06, 9 November 2014
- === String Matching Algorithms === === Sorting Algorithms ===4 KB (380 words) - 15:13, 30 November 2020
- # A directed graph <math>G=(V,A)</math> == Known algorithms ==416 bytes (69 words) - 10:39, 20 October 2014
- # A directed graph <math>G=(V,A)</math> == Known algorithms ==470 bytes (79 words) - 10:32, 20 October 2014
- ...asic graph definitions#Cycles|ordinary cycle]] in a directed or undirected graph that contains each edge/arc exactly once. # A directed or undirected graph is called '''eulerian''' if it admits a eulerian cycle.2 KB (307 words) - 20:57, 12 November 2014
- # [[Basic graph definitions]] # An undirected graph <math>G=(V,E)</math>.2 KB (264 words) - 17:37, 6 December 2014
- # [[Basic graph definitions]] An undirected graph <math>G=(V,E)</math>.2 KB (305 words) - 09:51, 6 December 2014
- # A [[Basic graph definitions|directed graph]] <math>G = (V,A)</math> ...e cycle, a shortest path exists, and at least one shortest path is [[Basic graph definitions#Paths|simple]] (because such a path may only contain cycles of1 KB (259 words) - 12:56, 22 October 2014
- # [[Basic graph definitions]] ...definitions#Directed and undirected graphs|simple, anti-symmetric directed graph]] <math>G=(V,A)</math>.2 KB (348 words) - 14:31, 1 December 2014
- ...ghly speaking, the run time of an algorithm is measured by the number of [[Algorithms and correctness#Instructions, operations and subroutines|operations]] execu For the inputs of an [[Algorithms and correctness#Algorithmic problem|algorithmic problem]], one or more (num4 KB (700 words) - 05:54, 25 April 2016
- [[Category:Graph Algorithms]] ## The '''depth''' of <math>v</math> in the [[Basic graph definitions#Forests, trees, branchings, arborescences|arborescence]] create6 KB (1,028 words) - 13:31, 3 November 2015
- # [[Basic graph definitions]] # A directed graph <math>G=(V,A)</math>.4 KB (786 words) - 08:58, 31 March 2018
- [[Category:Graph Algorithms]] ...t <math>G^t=(V,A^t)</math> be the [[Basic graph definitions#Transpose of a graph|transpose]] of <math>G=(V,A)</math>.4 KB (789 words) - 07:37, 2 November 2015
- ...a [[Basic graph definitions#Directed and undirected graphs|simple directed graph]] and for each arc <math>a\in A</math> let <math>\ell(a)</math> be a real n ...th''' of an [[Basic graph definitions#Paths|ordinary path]] (incl. [[Basic graph definitions#Cycles|ordinary cycles]]) is the sum of the lengths of all arc11 KB (2,059 words) - 14:34, 5 December 2014
- There is no more [[Basic graph definitions#Paths|ordinary <math>(s,t)</math>-path]] in <math>G</math>. ...4+5 from <math>v_0</math> on the [[Basic graph definitions#Transpose of a graph|transpose]] of <math>G</math> with the value of <math>T(v_0)</math> as comp4 KB (788 words) - 11:27, 16 March 2017
- # Construct the [[Basic graph definitions#Cycles|acyclic]] [[Basic graph definitions#Subgraphs|subgraph]] <math>G'=(V',A')</math> of the residual ne # Use one of the algorithms for the [[Blocking flow|blocking flow]] problem to construct a blocking flo2 KB (334 words) - 10:43, 8 January 2015
- [[Category:Algorithms]] [[Category:Search Algorithms]]7 KB (1,165 words) - 07:50, 26 October 2015
- ...orks on a nonnegative variation of the cost values, which allows efficient algorithms. ...minimal sets|inclusion-maximal]] subpaths of <math>C</math> whose [[Basic graph definitions#Paths|internal nodes]] do not belong to <math>p</math>. In oth6 KB (1,107 words) - 10:08, 6 May 2015
- [[Category:Algorithms]] [[Category:Search Algorithms]]11 KB (1,966 words) - 06:52, 26 October 2015
- # [[Basic graph definitions]] ...definitions#Directed and undirected graphs|anti-symmetric, simple directed graph]], unless stated otherwise.11 KB (2,126 words) - 13:42, 17 November 2015
- [[Category:Graph Algorithms]] ...er one from <math>t</math> on the [[Basic graph definitions#Transpose of a graph|transpose]] of <math>G</math>. This variant is called '''bidirectional sear10 KB (1,765 words) - 08:35, 14 January 2021