24 pages matching graph X,T in this book
Results 1-3 of 24
What people are saying - Write a review
We haven't found any reviews in the usual places.
Fundamental concepts of graph theory
3 other sections not shown
a,b e adjacency matrix apply the modified arc i,j Augsburg Karlsruhe automorphism binary operation binary relations broschiert 12,50 DM Brucker called chain chapter components of X,T computing graph constructed corresponding partition decomposition algorithm defined denote efficient paths equivalence relation exactly n arcs f o g fl-network free monoid graph G graph X,T greatest element Heft i e r(j i,j e implies ISBN Karlsruhe Aachen knapsack problem lemma Let F Let X,T Let X,T,f linear decomposition MATHEMATICAL SYSTEMS matrix F maximal cyclic index minimum operation modified matrix algorithm MURCHLAND ordered ZU-semiring permutation matrix positive semidefinite Proof real numbers representation resp satisfies condition 3.4.1 Seiten shortest paths signed graph simple i,j-paths simple paths simplified matrix algorithm step Strongly connected graph symmetric SYSTEMS IN ECONOMICS triple operations valuation matrix vertex vertices belong weak components weakly connected graph zero divisors