Mathematics throughout the ages II

algorithm arborescence authors BELLMAN Boolean algebras BORŮVKA Brno calculating called Chapter condition connected construction ČULÍK Czech mathematician DANTZIG defined Definition denoted described diameter DIJKSTRA directed graph discrete optimization discrete optimization problems distance elements equation EULER Eulerian example exists finite graph formulation FULKERSON given graph G(V,E graph theory graph-theoretical Hamiltonian cycle heuristics integer isomorphic JARNÍK KÖNIG KOŘÍNEK KOTZIG KRUSKAL label lattice theory lemniscate length linear programming LOBERMAN and WEINBERGER ŁUKASZEWICZ mathe matrix maximal flow method minimum spanning tree modular lattice monograph MOORE network flow network flow problems node notions Operations Research Otakar Borůvka partitions presented PRIM prob procedure published quotients RIEGER satisfies shortest path problem shortest-route tree solution solving spanning tree problem step subset subtree theorem thesis tion topology transportation problem travelling salesman problem travelling-salesman problem undirected vertex vertices Vojtěch Vojtěch Jarník weighted graphs Wratislavia Wrocław Zassenhaus