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.
For questions about the usage and manipulation of Directed Acyclic Graphs (DAG).
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.
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 on graph coloring, an assignment of colors to elements of a graph subject to specific constraints.
Questions about algorithms related to substrings, or about properties of substrings.
Theory of dynamic processes with several competing actors that try to achieve some goal in a strategic way.
Using the techniques of artificial intelligence and machine learning to extract patterns from large data sets and transforming those data into a useful, organized form for future processing.
Questions about genesis and development of computer science as a scientific discipline and its applications.
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…
The spanning tree of a connected undirected graph G is a tree having all the vertices and some number of edges of G.
General questions regarding learning computer science disciplines and CS education
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…
Used in questions asking for efficient (polynomial-time) reductions between computational problems.
Questions about the binary search algorithm, which can be used to find elements of an ordered list in O(log n) time.
Questions about algorithms that deterministically generate sequences of numbers that have stochastic properties of random sequences.
Questions about the relation of (subfields of) computer science to the relevant mathematical foundations and their application.
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…
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…
Questions related to mathematical analysis (often called analysis by mathematicians)
Questions about methods and techniques to prove correctness of programs.
A clique is a subset of the vertices of a graph such that every pair of vertices in the subset is connected by an edge.
An overlapping feature of type theory and type systems.
Questions about techniques for enforcing an agreed order of events between several concurrently executing threads. Specific synchronization mechanisms include mutexes (locks), condition variables, se…