Graph Theory: An Algorithmic Approach |
Contents
Introduction | 1 |
Degrees of a Vertex | 7 |
Matrix Representations | 15 |
Copyright | |
41 other sections not shown
Common terms and phrases
activity added addition algorithm allocation alternating application assignment assume becomes blossom branching calculated called capacity cardinality centre Chapter colouring column complete computation connected considered contains corresponding cost cost matrix covering cut-set defined described directed distance elementary equal example exists feasible final flow flow pattern follows given go to step graph G Hamiltonian circuit hence implies independent initial iteration labels least length lower bound matching matrix maximal maximum median method minimal negative nondirected graph obtained obviously operation optimal p-median partial points possible practical problem produce programming reach reachable regions removed represent respectively resulting root satisfies shortest path shown in Fig shows single solution solved spanning tree stage Steiner step terminal theorem travelling salesman vertex vertex x vertices weights x₁