A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.
Clustering is the problem of finding groups of data points (often modelled as nodes in a graph) that are closer to each other than to other points.
Questions about genesis and development of computer science as a scientific discipline and its applications.
The spanning tree of a connected undirected graph G is a tree having all the vertices and some number of edges of G.
A class of computational problems. Where decision problems call for a yes-or-no answer, search problems are looking for an object satisfying a certain property.
For questions about the usage and manipulation of Directed Acyclic Graphs (DAG).
Theory of dynamic processes with several competing actors that try to achieve some goal in a strategic way.
Questions on genetic algorithms, a family of evolutionary search heuristics. Genetic Algorithms are adaptive heuristic search algorithms based on the evolutionary ideas of natural selection and generi…
Questions on graph coloring, an assignment of colors to elements of a graph subject to specific constraints.
Questions about the binary search algorithm, which can be used to find elements of an ordered list in O(log n) time.
Divide-and-conquer is an algorithmic technique in which a problem is divided into smaller subproblems, whose solutions are combined to a solution of the original problem. Classical examples include me…
For questions about representing numbers in base 2 or performing arithmetic on them.
A method in analysis of algorithms that considers the overall cost of a sequence of operations.
General questions regarding learning computer science disciplines and CS education
Questions about algorithms related to substrings, or about properties of substrings.
Questions about the relation of (subfields of) computer science to the relevant mathematical foundations and their application.
Questions about algorithms that deterministically generate sequences of numbers that have stochastic properties of random sequences.
Questions about techniques for enforcing an agreed order of events between several concurrently executing threads. Specific synchronization mechanisms include mutexes (locks), condition variables, se…
Used in questions asking for efficient (polynomial-time) reductions between computational problems.
Questions about methods and techniques to prove correctness of programs.
Set cover is a well-known NP-complete problem: given a collection of sets, find as small as possible a subcollection whose union is the same as the union of the entire collection.
Category theory is used to formalize mathematics and its concepts as a collection of objects and arrows (also called morphisms). Category theory can be used to formalize concepts of other high-level a…
Questions related to mathematical analysis (often called analysis by mathematicians)
Research on methods and techniques to ensure the utility and quality of software systems through design and development processes.
Error correcting codes are used to transmit information through a noisy channel. They also have applications in theoretical computer science and combinatorics. Some well known error correcting codes a…
An overlapping feature of type theory and type systems.
Questions about ambiguity in context-free grammars.
The Kolmogorov complexity of a string s is equal to the length of the shortest program computing s and halting. Measures the lack of structure in a string.