Search results

Page title matches

• Lecture: Efficient Graph Algorithms
  5 KB (732 words) - 09:07, 13 February 2016
• Efficient Graph Algorithms:Gallery
  #REDIRECT [[Lecture: Efficient Graph Algorithms]]
  49 bytes (5 words) - 22:36, 13 October 2015

Page text matches

• Exhaustive graph traversal
  A [[Basic graph definitions|directed graph]] <math>G=(V,A)</math>. == Known algorithms ==
  195 bytes (27 words) - 07:21, 3 November 2014
• Biconnected components
  # [[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
• Strongly connected components
  # [[Basic graph definitions]] A [[Basic graph definitions|directed graph]] <math>G=(V,A)</math>.
  429 bytes (58 words) - 19:07, 9 November 2014
• Minimum spanning tree
  # 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]] <ma
  539 bytes (79 words) - 12:33, 16 June 2015
• Maximum spanning forest
  # 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
• Efficient Graph Algorithms:Gallery
  #REDIRECT [[Lecture: Efficient Graph Algorithms]]
  49 bytes (5 words) - 22:36, 13 October 2015
• Maximum branching
  # [[Basic graph definitions]] # A directed graph <math>G=(V,A)</math>:
  689 bytes (107 words) - 07:53, 8 November 2015
• Blocking flow
  # [[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
• Graph traversal
  # [[Basic graph definitions]] # A [[Basic graph definitions|directed graph]] <math>G=(V,A)</math>.
  2 KB (314 words) - 19:06, 9 November 2014
• Main Page
  === String Matching Algorithms === === Sorting Algorithms ===
  4 KB (380 words) - 15:13, 30 November 2020
• Single source single target shortest paths
  # A directed graph <math>G=(V,A)</math> == Known algorithms ==
  416 bytes (69 words) - 10:39, 20 October 2014
• Single source shortest paths
  # A directed graph <math>G=(V,A)</math> == Known algorithms ==
  470 bytes (79 words) - 10:32, 20 October 2014
• Eulerian cycle
  ...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
• Maximum-weight matching
  # [[Basic graph definitions]] # An undirected graph <math>G=(V,E)</math>.
  2 KB (264 words) - 17:37, 6 December 2014
• Cardinality-maximal matching
  # [[Basic graph definitions]] An undirected graph <math>G=(V,E)</math>.
  2 KB (305 words) - 09:51, 6 December 2014
• All pairs shortest paths
  # 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 of
  1 KB (259 words) - 12:56, 22 October 2014
• Min-cost flow problem
  # [[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
• Asymptotic complexity of algorithms
  ...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 (num
  4 KB (700 words) - 05:54, 25 April 2016
• 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
• Max-Flow Problems
  # [[Basic graph definitions]] # A directed graph <math>G=(V,A)</math>.
  4 KB (786 words) - 08:58, 31 March 2018

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