Search results

• Repeated depth-first search
  '''Algorithmic problem:''' [[Exhaustive graph traversal]] ...ns#Forests, trees, branchings, arborescences|branching]] that is a [[Basic graph definitions#Subgraphs|spanning subgraph]] of <math>G</math> (cf. [[Depth-fi
  2 KB (294 words) - 07:28, 3 November 2014
• Hopcroft-Tarjan
  [[Category:Graph Algorithms]] ## The '''depth''' of <math>v</math> in the [[Basic graph definitions#Forests, trees, branchings, arborescences|arborescence]] create
  6 KB (1,028 words) - 13:31, 3 November 2015
• Bipartite graph
  [[File:Bipartite-graph.png|200px|thumb|right|A simple bipartite graph]] An undirected graph <math>G=(V,E)</math> is called '''bipartite''' if there is a partition of <
  2 KB (319 words) - 11:33, 13 October 2014
• Alternating paths algorithm
  '''Prerequisites:''' The graph <math>G</math> is [[Bipartite graph|bipartite]].
  1 KB (190 words) - 13:38, 27 January 2015
• Kosaraju
  [[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
• Blocking flow by Dinic
  ...nitions#Flow-augmenting paths and saturated arcs|flow-augmenting]] [[Basic graph definitions#Paths|ordinary <math>(s,t)</math>-path]] in <math>G</math>. ...rch|DFS]] from <math>s</math> with two modifications: (1) The search may [[Graph traversal#Remarks|terminate early]], namely when <math>t</math> is seen; (2
  3 KB (479 words) - 08:37, 7 December 2015
• Classical eulerian cycle algorithm
  ## Remove <math>(x,y)</math> from the graph. ...er, the graph handed over to a recursive call is Eulerian, if the original graph was Eulerian.
  4 KB (673 words) - 08:15, 2 November 2015
• Three indians' algorithm
  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 comp
  4 KB (788 words) - 11:27, 16 March 2017
• Classical bipartite cardinality matching
  [[Cardinality-maximal matching|Cardinality-maximal matching]] in [[Basic graph definitions#Bipartite and k-partite graphs|bipartite graphs]]. ...ersal|graph traversal strategy]] is to be chosen that generates an [[Basic graph definitions#Forests, trees, branchings, arborescences|arborescence]] rooted
  7 KB (1,284 words) - 08:49, 22 February 2015
• Ford-Fulkerson
  ...dition is fulfilled, and nothing is to show. So consider the case that the graph traversal does hit <math>t</math>. Then an <math>(s,t)</math>-path is found '''Proof:''' A graph search from <math>s</math> requires <math>\Omicron (m)</math> . Obviously,
  3 KB (425 words) - 11:49, 23 June 2015
• Single source single target shortest paths
  # A directed graph <math>G=(V,A)</math>
  416 bytes (69 words) - 10:39, 20 October 2014
• Basic graph definitions
  # A '''directed graph''' <math>G=(V,A)</math> consists of a finite set <math>V</math> of '''nodes # An undirected graph <math>G=(V,E)</math> consists of a finite set <math>V</math> of '''nodes'''
  15 KB (2,712 words) - 14:47, 16 May 2015
• Single source shortest paths
  # A directed graph <math>G=(V,A)</math>
  470 bytes (79 words) - 10:32, 20 October 2014
• Dinic
  # Construct the [[Basic graph definitions#Cycles|acyclic]] [[Basic graph definitions#Subgraphs|subgraph]] <math>G'=(V',A')</math> of the residual ne
  2 KB (334 words) - 10:43, 8 January 2015
• Basic flow definitions
  # [[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
• Branching by Edmonds
  ...:''' The output of a recursive call is a maximum branching of the weighted graph that was the input for this recursive call. By definition, a critical graph contains one incoming arc for each node that does have incoming arcs. There
  7 KB (1,243 words) - 07:59, 8 November 2015
• Max-Flow Problems
  # [[Basic graph definitions]] # A directed graph <math>G=(V,A)</math>.
  4 KB (786 words) - 08:58, 31 March 2018
• Basics of shortest paths
  ...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 arc
  11 KB (2,059 words) - 14:34, 5 December 2014
• Hungarian method
  ...matching]] in [[Basic graph definitions#Complete graphs|complete]] [[Basic graph definitions#Bipartite and k-partite graphs|bipartite]] graphs <math>G=(V_1\ ...v\}</math> and <math>T:=\emptyset</math> and a dynamically growing [[Basic graph definitions#Forests, trees, branchings, arborescences|arborescence]] <math>
  6 KB (1,033 words) - 17:26, 27 February 2015
• Hopcroft-Karp
  [[Cardinality-maximal matching|Cardinality-maximal matching]] in [[Basic graph definitions#Bipartite and k-partite graphs|bipartite graphs]]. ...math>S</math> of [[Breadth-first search|BFS]] runs as iterators (cf. the [[Graph traversal#Remarks|remark on iterators]]). The [[Matchings in graphs#Finding
  6 KB (1,029 words) - 15:00, 6 December 2014

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)