Theory of Matrix Algorithms |
Contents
Fundamental concepts of graph theory | 1 |
Chapter II | 11 |
Networks | 23 |
Copyright | |
6 other sections not shown
Common terms and phrases
A₁ U X₁ adjacency matrix AFRIAT Ottawa apply the modified arc i,j automorphism B₁ BRUCKER called chain chapter Cij k-1 circuits computing graph constructed corresponding partition cyclic decomposition decomposition algorithm defined efficient equivalence classes equivalence relation exists fij)NxN finite free monoid Furthermore greatest element Heft homomorphism HU and TORRES i,j ɛ iɛI implies initial vertex ISBN knapsack problem lemma Let F Let X,I,f M₁ M₂ matrix F maximal cyclic index minimal cut set modified matrix algorithm monoid NEUMANN Karlsruhe ordered ZU-semiring permutation matrix positive semidefinite Proof pseudoarc R-network real numbers representation resp satisfies condition 3.4.1 Seiten sequence shortest paths signed graph simple i,j-paths simple paths simplified matrix algorithm smallest integer step structure suitable integer symmetric SYSTEMS IN ECONOMICS triple operations 5.3.1 valuation matrix vertex vertices belong weak components weakly connected graph WEEij X₁ U A₂ zero divisors