## Graph Algorihms |

### What people are saying - Write a review

#### LibraryThing Review

User Review - Lyndatrue - LibraryThingIt's still a beautiful book. It naturally falls open to Depth-First Search, and to Maximum Flow in a Network. I wonder what I was working on, in those long ago days? This book is not for the faint of ... Read full review

### Common terms and phrases

2-colorable 3SAT assigned assume augmenting path back edge backtrack binary bridges called circuit in G circuit-free clauses Clearly clique code-word colored complexity computation construction corresponding cutset decision problem defined as follows deletion digraph G(V directed circuit directed path directed tree disjoint edge connectivity edge entering edges incident endpoints Euler circuit Euler path exists Figure finite digraph flow function flow problem go to Step graph G graph G(V graph theory halt induction input labeled layered network least legal flow length Let G(V maximum flow minimum spanning tree number of edges parallel edges planar plane graph plane realization positive integer prefix code Proof Prove reachable right parentheses root satisfies scanned self-loops separating vertex sequence set of edges set of vertices shown in Fig simple circuit simple path solve subgraph subset Tarjan Theorem total flow tree edges tree of G Turing machine undirected graph vertex connectivity vertex separator