Search results

Page title matches

• Directed graph
  ...es in contrast to unordered pairs of nodes (called edges) in an undirected graph. An arc <math>a = (v, w)</math> is considered to be directed '''from''' <ma
  445 bytes (82 words) - 20:12, 17 November 2014
• Undirected graph
  68 bytes (8 words) - 00:32, 17 June 2015
• 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
• 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
• Exhaustive graph traversal
  A [[Basic graph definitions|directed graph]] <math>G=(V,A)</math>.
  195 bytes (27 words) - 07:21, 3 November 2014
• K-partite graph
  An undirected graph <math>G=(V,E)</math> is called '''k-partite''', if there is a partition of For <math>k=2</math>, <math>G</math> is called [[bipartite graph]].
  536 bytes (96 words) - 19:53, 17 November 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
• 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

• 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
• Directed graph
  ...es in contrast to unordered pairs of nodes (called edges) in an undirected graph. An arc <math>a = (v, w)</math> is considered to be directed '''from''' <ma
  445 bytes (82 words) - 20:12, 17 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
• Exhaustive graph traversal
  A [[Basic graph definitions|directed graph]] <math>G=(V,A)</math>.
  195 bytes (27 words) - 07:21, 3 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
• 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
• Bipartite graphs
  #REDIRECT [[Bipartite graph]]
  29 bytes (3 words) - 08:53, 5 October 2014
• 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
• 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
• 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
• K-partite graph
  An undirected graph <math>G=(V,E)</math> is called '''k-partite''', if there is a partition of For <math>k=2</math>, <math>G</math> is called [[bipartite graph]].
  536 bytes (96 words) - 19:53, 17 November 2014
• Cardinality-maximal matching
  # [[Basic graph definitions]] An undirected graph <math>G=(V,E)</math>.
  2 KB (305 words) - 09:51, 6 December 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
• Main Page
  === Graph Theory === * [[Directed graph]]
  4 KB (380 words) - 15:13, 30 November 2020
• Matchings in graphs
  ...teq E</math> of edges such that no two edges in <math>M</math> are [[Basic graph definitions#Adjacency, incidence, and degree|incident]]. # A path <math>p</math> in an undirected graph <math>G=(V,E)</math> is called '''alternating''' with respect to some match
  7 KB (1,194 words) - 09:53, 22 February 2015
• Maximum matching by Edmonds
  Each recursive step returns a cardinality-maximal matching of its input graph. The graph search does not find an augmenting path, nor does it run into a [[Matchings
  4 KB (671 words) - 09:25, 22 February 2015
• 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

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