Category:Graph algorithms

From Wikipedia, the free encyclopedia

Jump to: navigation, search

The main section for this category is in the article List of algorithms, in the section titled Graph algorithms.

Wikimedia Commons has media related to: Graph algorithms

Graph algorithms solve problems related to graph theory.

Subcategories

This category has the following 5 subcategories, out of 5 total.

G

• ► Graph drawing‎ (2 C, 19 P)
• ► Graph rewriting‎ (6 P)

N

• ► Network flow‎ (13 P)

S

• ► Spanning tree‎ (23 P)

T

• ► Travelling salesman problem‎ (9 P)

Pages in category "Graph algorithms"

The following 87 pages are in this category, out of 87 total. This list may not reflect recent changes (learn more).

A A* search algorithm Algorithmic version for Szemerédi regularity partition Alpha-beta pruning Aperiodic graph B B* Barabási–Albert model Belief propagation Bellman–Ford algorithm Bidirectional search Borůvka's algorithm Bottleneck traveling salesman problem Breadth-first search Bron–Kerbosch algorithm C Chaitin's algorithm Cheriyan–Mehlhorn/Gabow algorithm Christofides algorithm Clique percolation method Closure problem Color-coding Contraction hierarchies Cuthill–McKee algorithm D D* Depth-first search Depth-limited search Dijkstra's algorithm Dijkstra–Scholten algorithm Dinic's algorithm Dulmage–Mendelsohn decomposition E Edmonds' algorithm

E cont. Edmonds's matching algorithm Edmonds–Karp algorithm Euler tour technique F FKT algorithm Flooding algorithm Flow network Floyd–Warshall algorithm Force-based algorithms (graph drawing) Ford–Fulkerson algorithm Fringe search G Girvan–Newman algorithm Goal node (computer science) Gomory–Hu tree Grafting (algorithm) Grafting (ordered tree) Graph bandwidth Graph embedding Graph isomorphism Graph isomorphism problem Graph reduction Graph rewriting Graph traversal H Hierarchical clustering of networks Hopcroft–Karp algorithm I IDA* Iterative deepening depth-first search J Johnson's algorithm Journal of Graph Algorithms and Applications K Karger's algorithm

K cont. Knight's tour Kosaraju's algorithm Kruskal's algorithm L Lexicographic breadth-first search Longest path problem M Minimax Minimum cut N Nearest neighbour algorithm Nonblocking minimal spanning switch P Planarity testing Prim's algorithm Proof-number search Push-relabel maximum flow algorithm R Reverse-delete algorithm S Sethi–Ullman algorithm Shortest path problem SMA* Spectral layout Strongly connected component Subgraph isomorphism problem Suurballe's algorithm T Tarjan's off-line least common ancestors algorithm Tarjan's strongly connected components algorithm Topological sorting Transitive reduction Travelling salesman problem Tree traversal U Uniform-cost search W Widest path problem

Retrieved from "http://en.wikipedia.org/w/index.php?title=Category:Graph_algorithms&oldid=470666979"

Categories:

• Combinatorial algorithms
• Computational problems in graph theory

• This page was last modified on 10 January 2012 at 19:50.
  
• Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. See Terms of use for details.
  Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
  
• Contact us

• Privacy policy
• About Wikipedia
• Disclaimers
• Mobile view