Graph algorithms: Dijkstra's algorithm, Travelling salesman problem, Kruskal's algorithm, Prim's algorithm, Shortest path problem - Softcover
Inhaltsangabe
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 102. Chapters: Dijkstra's algorithm, Travelling salesman problem, Kruskal's algorithm, Prim's algorithm, Shortest path problem, Nearest neighbour algorithm, Ford-Fulkerson algorithm, Knight's tour, Minimax, A* search algorithm, Depth-first search, Breadth-first search, Alpha-beta pruning, Bellman-Ford algorithm, Graph isomorphism problem, Belief propagation, Nonblocking minimal spanning switch, Floyd-Warshall algorithm, Hopcroft-Karp algorithm, Gomory-Hu tree, Bron-Kerbosch algorithm, Force-based algorithms, Tree traversal, Color-coding, Edmonds's matching algorithm, Topological sorting, FKT algorithm, Flow network, Barabási-Albert model, Edmonds-Karp algorithm, Clique percolation method, Graph embedding, Planarity testing, Push-relabel maximum flow algorithm, Graph rewriting, Subgraph isomorphism problem, D*, Lexicographic breadth-first search, Closure problem, Suurballe's algorithm, Tarjan's strongly connected components algorithm, Algorithmic version for Szemerédi regularity partition, Longest path problem, Dinic's algorithm, Johnson's algorithm, Graph bandwidth, B*, Edmonds' algorithm, Sethi-Ullman algorithm, Iterative deepening depth-first search, Borůvka's algorithm, Fringe search, Reverse-delete algorithm, Girvan-Newman algorithm, Aperiodic graph, Transitive reduction, Graph reduction, Bidirectional search, Dijkstra-Scholten algorithm, Uniform-cost search, Euler tour technique, Hierarchical clustering of networks, Tarjan's off-line least common ancestors algorithm, IDA*, Karger's algorithm, Cheriyan-Mehlhorn/Gabow algorithm, Journal of Graph Algorithms and Applications, Depth-limited search, William Lawrence Kocay, Christofides algorithm, Junction tree algorithm, Kosaraju's algorithm, AF-heap, Flooding algorithm, Minimum cut, Cuthill-McKee algorithm, Bottleneck traveling salesman problem, SMA*, Grafting, Proof-number searc...
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 102. Chapters: Dijkstra's algorithm, Travelling salesman problem, Kruskal's algorithm, Prim's algorithm, Shortest path problem, Nearest neighbour algorithm, Ford-Fulkerson algorithm, Knight's tour, Minimax, A* search algorithm, Depth-first search, Breadth-first search, Alpha-beta pruning, Bellman-Ford algorithm, Graph isomorphism problem, Belief propagation, Nonblocking minimal spanning switch, Floyd-Warshall algorithm, Hopcroft-Karp algorithm, Gomory-Hu tree, Bron-Kerbosch algorithm, Force-based algorithms, Tree traversal, Color-coding, Edmonds's matching algorithm, Topological sorting, FKT algorithm, Flow network, Barabási-Albert model, Edmonds-Karp algorithm, Clique percolation method, Graph embedding, Planarity testing, Push-relabel maximum flow algorithm, Graph rewriting, Subgraph isomorphism problem, D*, Lexicographic breadth-first search, Closure problem, Suurballe's algorithm, Tarjan's strongly connected components algorithm, Algorithmic version for Szemerédi regularity partition, Longest path problem, Dinic's algorithm, Johnson's algorithm, Graph bandwidth, B*, Edmonds' algorithm, Sethi-Ullman algorithm, Iterative deepening depth-first search, Borůvka's algorithm, Fringe search, Reverse-delete algorithm, Girvan-Newman algorithm, Aperiodic graph, Transitive reduction, Graph reduction, Bidirectional search, Dijkstra-Scholten algorithm, Uniform-cost search, Euler tour technique, Hierarchical clustering of networks, Tarjan's off-line least common ancestors algorithm, IDA*, Karger's algorithm, Cheriyan-Mehlhorn/Gabow algorithm, Journal of Graph Algorithms and Applications, Depth-limited search, William Lawrence Kocay, Christofides algorithm, Junction tree algorithm, Kosaraju's algorithm, AF-heap, Flooding algorithm, Minimum cut, Cuthill-McKee algorithm, Bottleneck traveling salesman problem, SMA*, Grafting, Proof-number searc...
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.