Algorithm and Design Complexity
portes grátis
Algorithm and Design Complexity
Alexander, S. Albert; Jasmine, Mary; Sherine, Anli; Peter, Geno
Taylor & Francis Ltd
12/2024
182
Mole
9781032409351
Pré-lançamento - envio 15 a 20 dias após a sua edição
Descrição não disponível.
1. Algorithm Analysis. 2. Divide and Conquer. 3. Dynamic programming. 4. Backtracking. 5. Graph.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Backtracking;Graph;Time Space Tradeoff;Binary Search;Dynamic Programming;Knapsackproblem;Knapsack Problem;Live Nodes;Answer Node;Traveling Salesperson Problem;Biconnected Components;External Nodes;Recursive Calls;Hamiltonian Cycle;Spanning Tree;Merge Sort;BST;Nondeterministic Algorithm;Minimum Cost Path;Counterfeit Coin;Kruskal's Algorithm;Dead Node;Undirected Graph;Halting Problem;State Space Search;Polynomial Time;Backtracking Algorithm;Greedy Algorithm;Prim's Algorithm
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Backtracking;Graph;Time Space Tradeoff;Binary Search;Dynamic Programming;Knapsackproblem;Knapsack Problem;Live Nodes;Answer Node;Traveling Salesperson Problem;Biconnected Components;External Nodes;Recursive Calls;Hamiltonian Cycle;Spanning Tree;Merge Sort;BST;Nondeterministic Algorithm;Minimum Cost Path;Counterfeit Coin;Kruskal's Algorithm;Dead Node;Undirected Graph;Halting Problem;State Space Search;Polynomial Time;Backtracking Algorithm;Greedy Algorithm;Prim's Algorithm
