minimal weight
1minimal — min•i•mal [[t]ˈmɪn ə məl[/t]] adj. 1) constituting a minimum: a minimal weight loss of two pounds a week[/ex] 2) of or pertaining to minimalism or minimal art • Etymology: 1660–70 min′i•mal•ly, adv …
2Minimal change disease — Classification and external resources The three hallmarks of Minimal Change Disease: diffuse loss of podocyte foot processes, vacuolation, and the appearance of microvilli. ICD …
3Weight loss — Classification and external resources ICD 9 783.21 For the episode of the American version of The Office, see Weight Loss (The Office). Weight loss, in the context of medicine, health or phys …
4Minimum-weight triangulation — In computational geometry and computer science, the minimum weight triangulation (MWT) problem is the problem of finding a triangulation of minimal weight. Of particular interest is the problem of finding a minimum weight point set triangulation …
5atomic weight — Chem. the average weight of an atom of an element, formerly based on the weight of one hydrogen atom taken as a unit or on 1/16 the weight of an oxygen atom, but after 1961 based on 1/12 the weight of the carbon 12 atom. Abbr.: at. wt. [1820 30]… …
6Random minimal spanning tree — In mathematics, random minimal spanning tree, or random MST, is a model (actually two related models) for a random tree (see also minimal spanning tree). It might be compared against the uniform spanning tree, a different model for a random tree… …
7Ultra-high-molecular-weight polyethylene — (UHMWPE or sometimes shortened to UHMW), also known as high modulus polyethylene (HMPE) or high performance polyethylene (HPPE), is a subset of the thermoplastic polyethylene. It has extremely long chains, with molecular weight numbering in the… …
8Ultra high molecular weight polyethylene — (UHMWPE), also known as high modulus polyethylene (HMPE) or high performance polyethylene (HPPE), is a subset of the thermoplastic polyethylene. It has extremely long chains, with molecular weight numbering in the millions, usually between 2 and… …
9Kruskal's algorithm — is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is… …
10Prim's algorithm — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional …
