extremal problem
Смотреть что такое "extremal problem" в других словарях:
extremal — /ik stree meuhl/, adj. Math. of or pertaining to an extremum or the calculation of extrema: an extremal problem. [1400 50; late ME. See EXTREM(UM), AL1] * * * … Universalium
extremal — /ik stree meuhl/, adj. Math. of or pertaining to an extremum or the calculation of extrema: an extremal problem. [1400 50; late ME. See EXTREM(UM), AL1] … Useful english dictionary
Extremal optimization — (EO) is an optimization heuristic inspired by the Bak Sneppen model of self organized criticality from the field of statistical physics. This heuristic was designed initially to address combinatorial optimization problems such as the travelling… … Wikipedia
Extremal graph theory — is a branch of mathematics. In the narrow sense, extremal graph theory studies the graphs which are extremal among graphs with a certain property. There are various meanings for the word extremal : with the largest number of edges, the largest… … Wikipedia
Moment problem — In mathematics, a moment problem arises as the result of trying to invert the mapping that takes a measure μ to the sequences of moments More generally, one may consider for an arbitrary sequence of functions Mn. Contents 1 … Wikipedia
Zarankiewicz problem — In the mathematical field of extremal graph theory, the Zarankiewicz problem asks how many edges can be added to a bipartite graph while avoiding a specific bipartite subgraph. Initially, the Polish mathematician K. Zarankiewicz proposed the… … Wikipedia
Isoperimetrisches Problem — Das isoperimetrische Problem der geometrischen Variationsrechnung fragt in seiner ursprünglichen, auf das klassische Griechenland zurückgehenden Form (siehe Problem der Dido), welche Form eine geschlossene Kurve mit gegebener Länge haben muss,… … Deutsch Wikipedia
Heilbronn triangle problem — In mathematics, the Heilbronn triangle problem is a typical question in the area of irregularities of distribution, within elementary geometry.Consider region D in the plane: a unit circle or general polygon mdash; the asymptotics of the problem … Wikipedia
Isoperimetric problem — In mathematics, isoperimetric problem may refer to:* The isoperimetric inequality between the length of a closed curve and the area of the region it encloses, as well as its generalizations. * Any of a class of extremal problems arising in… … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
Clique (graph theory) — A graph with 23 1 vertex cliques (its vertices), 42 2 vertex cliques (its edges), 19 3 vertex cliques (the light blue triangles), and 2 4 vertex cliques (dark blue). Six of the edges and 11 of the triangles form maximal cliques. The two dark blue … Wikipedia
