Fundamentals of Computer Algorithms

adjacency adjacency lists answer node array assignment assume backtracking biconnected components binary search tree binary tree bounding functions branch-and-bound C₁ child clique comparisons complete computing contains corresponding decision problem defined determine dynamic programming E-node edges elements evaluate example exercise formula game tree given graph G greedy Hamiltonian cycle hash Hence input insert integer internal nodes iteration knapsack problem leaf nodes live nodes lower bound matrix maximum merge MERGESORT method minimum cost multiplication needed nondeterministic algorithm NP-complete NP-hard O(n log obtain operations optimal code optimal solution P₁ partitioning polynomial possible problem instance procedure processor Proof queue QUICKSORT recursive repeat end represent requires result rithm S₁ schedule Section sequence shortest path Show solved sorted space tree spanning tree stack statement stored subset Theorem traversal tree of Figure tuple undirected graph V₁ variables vertex vertices worst Write an algorithm