|
Otakar Borůvka
Otakar Borůvka (10 May 1899 in Uherský Ostroh – 22 July 1995 in Brno) was a Czech mathematician best known today for his work in graph theory.. Education and career Borůvka was born in Uherský Ostroh, a town in Moravia (then in Austria-Hungary, later Czechoslovakia; today Czech Republic), the son of a school headmaster. He attended the grammar school in Uherské Hradiště beginning in 1910. In 1916, influenced by the ongoing World War I, he moved to the military school (Realschule) in Hranice, and later he enrolled into the Imperial and Royal Technical Military Academy in Mödling near Vienna. When the war ended, Borůvka returned to Uherské Hradiště, finished his studies in 1918 at the Gymnasium there, and became a student at the Imperial Czech Technical University of Franz Joseph, in Brno, initially studying civil engineering. In 1920, Masaryk University opened in Brno, and Borůvka also began taking courses there. He became an assistant to Mathias Lerch at Masar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uherský Ostroh
Uherský Ostroh (; german: Ungarisch Ostra) is a town in Uherské Hradiště District in the Zlín Region of the Czech Republic. It has about 4,300 inhabitants. The historic town centre is well preserved and is protected by law as an urban monument zone. Administrative parts Town parts of Kvačice and Ostrožské Předměstí are administrative parts of Uherský Ostroh. Etymology The name literally means "Hungarian promontory". It refers to its historic location on a promontory near borders with Kingdom of Hungary. Geography Uherský Ostroh is located about southwest of Uherské Hradiště and southwest of Zlín. The town lies on the Morava river, at its confluence with the Okluky River. The western part of the municipal territory lies in the Lower Morava Valley, the eastern part lies in the Vizovice Highlands. History A predecessor of the town was a settlement called Stenice, located on an island of the river Morava. The settlement existed here in the second half of the 11 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Civil Engineering
Civil engineering is a professional engineering discipline that deals with the design, construction, and maintenance of the physical and naturally built environment, including public works such as roads, bridges, canals, dams, airports, sewage systems, pipelines, structural components of buildings, and railways. Civil engineering is traditionally broken into a number of sub-disciplines. It is considered the second-oldest engineering discipline after military engineering, and it is defined to distinguish non-military engineering from military engineering. Civil engineering can take place in the public sector from municipal public works departments through to federal government agencies, and in the private sector from locally based firms to global Fortune 500 companies. History Civil engineering as a discipline Civil engineering is the application of physical and scientific principles for solving the problems of society, and its history is intricately linked to advances in t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algorithm
In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific Computational problem, problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can perform automated deductions (referred to as automated reasoning) and use mathematical and logical tests to divert the code execution through various routes (referred to as automated decision-making). Using human characteristics as descriptors of machines in metaphorical ways was already practiced by Alan Turing with terms such as "memory", "search" and "stimulus". In contrast, a Heuristic (computer science), heuristic is an approach to problem solving that may not be fully specified or may not guarantee correct or optimal results, especially in problem domains where there is no well-defined correct or optimal result. As an effective method, an algorithm ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Minimum Spanning Tree
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible. More generally, any edge-weighted undirected graph (not necessarily connected) has a minimum spanning forest, which is a union of the minimum spanning trees for its connected components. There are many use cases for minimum spanning trees. One example is a telecommunications company trying to lay cable in a new neighborhood. If it is constrained to bury the cable only along certain paths (e.g. roads), then there would be a graph containing the points (e.g. houses) connected by those paths. Some of the paths might be more expensive, because they are longer, or require the cable to be buried deeper; these paths would be represented by edges with larger weights ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
