log-log graph
81Kruskal-Algorithmus — Der Algorithmus von Kruskal ist ein Algorithmus der Graphentheorie zur Berechnung minimaler Spannbäume von ungerichteten Graphen. Der Graph muss dazu zusätzlich zusammenhängend, kantengewichtet und endlich sein. Der Algorithmus stammt von Joseph… …
82cho — ace·tyl·cho·line; ace·tyl·cho·lin·esterase; am·ni·o·cho·ri·on; an·cho·ress; an·cho·rit·ess; an·cho·rit·ic; an·cho·rit·ism; an·cho·veta; an·cho·vy; an·gi·o·cho·li·tis; an·ti·cho·lin·es·ter·ase; ar·cho·plasm; ar·cho·sau·ria; au·tar·cho·glos·sa;… …
83Algorithmus von Kruskal — Der Algorithmus von Kruskal ist ein Algorithmus der Graphentheorie zur Berechnung minimaler Spannbäume von ungerichteten Graphen. Der Graph muss dazu zusätzlich zusammenhängend, kantengewichtet und endlich sein. Der Algorithmus stammt von Joseph… …
84Big O notation — In mathematics, big O notation is used to describe the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions. It is a member of a larger family of notations that is… …
85Maximal independent set — This article is about the combinatorial aspects of maximal independent sets of vertices in a graph. For other aspects of independent vertex sets in graph theory, see Independent set (graph theory). For other kinds of independent sets, see… …
86Markov random field — A Markov random field, Markov network or undirected graphical model is a set of variables having a Markov property described by an undirected graph. A Markov random field is similar to a Bayesian network in its representation of dependencies. It… …
87Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… …
88Erdős–Stone theorem — In extremal graph theory, the Erdős–Stone theorem is an asymptotic result generalising Turán s theorem to bound the number of edges in an H free graph for a non complete graph H . It is named after Paul Erdős and Arthur Stone, who proved it in… …
89mat — ach·ro·mat; ach·ro·mat·ic; achro·mat·o·cyte; ac·ous·mat·ic; ac·ro·a·mat·ic; ac·ro·a·mat·ics; ac·ro·mon·o·gram·mat·ic; ag·al·mat·o·lite; ag·ro·cli·mat·ic; al·lo·chro·mat·ic; al·lo·se·mat·ic; amag·mat·ic; am·bly·chro·mat·ic; am·phi·sto·mat·ic;… …
90Permanent is sharp-P-complete — The correct title of this article is Permanent is #P complete. The substitution or omission of the # sign is because of technical restrictions. In a 1979 paper Leslie Valiant proved[1] that the problem of computing the permanent of a matrix is #P …
