What people are saying - Write a review
We haven't found any reviews in the usual places.
TREES AND ACYCLIC DIGRAPHS
8 other sections not shown
acyclic adjacency list adjacency matrix array assigned augmenting path back edge backtracking binary bipartite graph blocked Boolean function bound breadth-first search coloring completes the proof computation connected conservative flow construct corresponding cost define Delete denote depth-first search Dfsnum(v digraph Dijkstra's algorithm edge weights edges of G endpoints equals example Fibonacci heap Floyd's algorithm following theorem graph G graph G(V hamiltonian hamiltonian path hypercube independent set input integer iteration length Let G(V Let G(V,E linear lnteger maximum flow maximum matching minimum spanning tree Nextcount NP-Complete operation optimal Output pair of vertices partition path algorithm perfect matching performance planar graph polynomial problem procedure processors prove random recursive Refer to Figure representation rithm root search path search tree set of vertices shortest path solution spanning cycle stack step strong component subgraph subtree technique unary tree undirected graph VC(G vertices in G Voronoi diagram weighted graph zero