Graphs, Networks, and AlgorithmsWiley, 1981 - Всего страниц: 592 Basic concepts. Trees, cutsets, and circuits. Eulerian and hamiltonian graphs. Graphs and vector spaces. Directed graphs. Matrices of a graph. Planarity and duality. Connectivity and matching. Covering and coloring. Matroids. Graphs and networks. Resistance n-port networks. Network functions and network sensitivity. Algorithmic analysis. Algorithmic optimization. |
Содержание
Basic Concepts | 3 |
Trees Cutsets and Circuits | 32 |
Eulerian and Hamiltonian Graphs | 56 |
Авторские права | |
Не показаны другие разделы: 13
Другие издания - Просмотреть все
Часто встречающиеся слова и выражения
adjacent algorithm augmenting path b₁ b₂ bipartite graph C₂ chord cocircuit coloring column component Comput connected graph Consider contains corresponding defined denote directed circuit directed graph directed path dual e₁ edge set edge-disjoint edge-induced subgraph edges incident edges of G electrical network elements end vertices entries Euler trail Eulerian graph exists following theorem fundamental circuit fundamental cutset G₁ G₂ go to step graph G graph of Fig Graph Theory Hence incidence matrix independent set induced subgraph labeled LEMMA length Let G matroid maximum matching n-port network n-vertex number of edges number of vertices obtained paths in G planar graph port Proof prove result S₁ S₂ self-loops sequence shown in Fig simple graph spanning tree strongly connected strongly connected component subgraph of G subset Suppose T₂ tip branch transitive closure tree of G undirected V₁ v₂ vector space vertex set vertices of G voltage W. T. Tutte