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.

The spanning tree of a connected undirected graph G is a tree having all the vertices and some number of edges of G.
127 questions
General questions regarding learning computer science disciplines and CS education
127 questions
a famous special case of the boolean satisfiability problem (SAT).
126 questions
a collection of disjoint sets whose union yields A.
125 questions
Questions about genesis and development of computer science as a scientific discipline and its applications.
125 questions
Theory of dynamic processes with several competing actors that try to achieve some goal in a strategic way.
124 questions
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.
123 questions
A method in analysis of algorithms that considers the overall cost of a sequence of operations.
122 questions
120 questions
Questions about the relation of (subfields of) computer science to the relevant mathematical foundations and their application.
118 questions
Questions about algorithms that deterministically generate sequences of numbers that have stochastic properties of random sequences.
114 questions
Questions about the binary search algorithm, which can be used to find elements of an ordered list in O(log n) time.
For questions about the usage and manipulation of Directed Acyclic Graphs (DAG).
111 questions
Questions about algorithms related to substrings, or about properties of substrings.
111 questions
Questions about techniques for enforcing an agreed order of events between several concurrently executing threads. Specific synchronization mechanisms include mutexes (locks), condition variables, se…
111 questions
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…
110 questions
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…
110 questions
Questions on graph coloring, an assignment of colors to elements of a graph subject to specific constraints.
109 questions
Questions about methods and techniques to prove correctness of programs.
109 questions
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.
108 questions
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…
104 questions
For questions about representing numbers in base 2 or performing arithmetic on them.
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.
103 questions
Questions related to mathematical analysis (often called analysis by mathematicians)
101 questions
equal to the length of the shortest program computing s and halting. Measures the lack of structure in a string.
101 questions
Research on methods and techniques to ensure the utility and quality of software systems through design and development processes.
101 questions
An overlapping feature of type theory and type systems.
100 questions
Questions about ambiguity in context-free grammars.
99 questions
Creating samples from a well-specified population using a probabilistic method and/or producing random numbers from a specified distribution.
98 questions
verifying that a variable, expression or value has the declared type
98 questions
3 4
6 7