intractability
91Michael Garey — Michael Randolph Garey is a computer science researcher, and co author (with David S. Johnson) of Computers and Intractability: A Guide to the Theory of NP completeness. He earned his PhD in computer science in 1970 from the University of… …
92Film gate — The film gate is the rectangular opening in the front of a motion picture camera where the film is exposed to light. The film gate can be seen by removing the lens and rotating the shutter out of the way. The film is held on a uniform plane at a… …
93Domatic number — A domatic partition. In graph theory, a domatic partition of a graph G = (V,E) is a partition of V into disjoint sets V1, V2,...,VK such that each Vi is a dominati …
94Feedback vertex set — In the mathematical discipline of graph theory, a feedback vertex set of a graph is a set of vertices whose removal leaves a graph without cycles. In other words, each feedback vertex set contains at least one vertex of any cycle in the graph.… …
95Feedback arc set — In graph theory, a directed graph may contain directed cycles, a one way loop of edges. In some applications, such cycles are undesirable, and we wish to eliminate them and obtain a directed acyclic graph (DAG). One way to do this is simply to… …
96Monochromatic triangle — The monochromatic triangle problem is a decision problem that is known to be NP complete. Input: An n node undirected graph G(V,E) with node set V and edge set E. Question: Can the edges, E, of G be partitioned into two disjoint sets E1 and E2,… …
97Karp's 21 NP-complete problems — One of the most important results in computational complexity theory was Stephen Cook s 1971 demonstration of the first (practically relevant) NP complete problem, the boolean satisfiability problem. [cite book|author = Stephen Cook|year =… …
98Set packing — is a classical NP complete problem in computational complexity theory and combinatorics, and was one of Karp s 21 NP complete problems. Suppose we have a finite set S and a list of subsets of S. Then, the set packing problem asks if some k… …
99Primidone — Systematic (IUPAC) name 5 ethyl 5 phenyl hexahydropyrimidine 4,6 dione Clinical data Pregnancy cat. D …
100Cut (graph theory) — In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. The cut set of the cut is the set of edges whose end points are in different subsets of the partition. Edges are said to be crossing the cut if they are… …
