empty edge
21Ramsey's theorem — This article goes into technical details quite quickly. For a slightly gentler introduction see Ramsey theory. In combinatorics, Ramsey s theorem states that in any colouring of the edges of a sufficiently large complete graph (that is, a simple… …
22Tic-tac-toe — Noughts and Crosses redirects here. For the series by Malorie Blackman, see Noughts Crosses series. Tic tac toe redirects here. For the band, see Tic Tac Toe (band). Tic tac toe Game play of Tic tac toe Genre(s) Paper and pencil game Players 2 …
23Prim's algorithm — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional …
24Movie projector — This article is concerned with technical aspects of moving film projection. For non film movie projection, see digital cinema. For historical aspects, see the article history of cinema. 35 mm movie projector in operation …
25Abkürzungen/Luftfahrt/L–R — Dies ist der vierte Teil der Liste Abkürzungen/Luftfahrt. Liste der Abkürzungen Teil 1 A A Teil 2 B–D B; C; D Teil 3 E–K …
26Crystal structure of boron-rich metal borides — Two single crystals of YB66 (1 cm diameter) grown by floating zone technique using (100) oriented seeds. In the top crystal, the seed (left from the black line) has same diameter as the crystal. In the bottom crystal (sliced), the seed is much… …
27Orbifold — This terminology should not be blamed on me. It was obtained by a democratic process in my course of 1976 77. An orbifold is something with many folds; unfortunately, the word “manifold” already has a different definition. I tried “foldamani”,… …
28Big Show (wrestler) — The Big Show Big Show in Tribute to Troops 2010 Ring name(s) (The) Big Show[1][2] …
29Go (game) — This article is about Go, the board game. For other uses, see Go (disambiguation). Goe redirects here. For other uses, see GOE (disambiguation). Go Go is played on a grid of black lines (usually 19×19). The playing pieces, called stones, are… …
30Topological sorting — Dependency resolution redirects here. For other uses, see Dependency (disambiguation). In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that, for every edge uv, u comes… …
