Faster access than browser!
23 relations: Algorithm, Array data structure, Chordal graph, Coffman–Graham algorithm, Collection (abstract data type), Complement (set theory), Data structure, Deterministic finite automaton, DFA minimization, Directed acyclic graph, Disjoint sets, Disjoint-set data structure, Doubly linked list, Finite-state machine, Graph theory, Intersection (set theory), Lexicographic breadth-first search, Lexicographical order, Neighbourhood (graph theory), Partition of a set, SIAM Journal on Computing, Sigma-algebra, Topological sorting.
Algorithm
In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.
New!!: Partition refinement and Algorithm · See more »
Array data structure
In computer science, an array data structure, or simply an array, is a data structure consisting of a collection of elements (values or variables), each identified by at least one array index or key.
New!!: Partition refinement and Array data structure · See more »
Chordal graph
In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not part of the cycle but connects two vertices of the cycle.
New!!: Partition refinement and Chordal graph · See more »
Coffman–Graham algorithm
In job shop scheduling and graph drawing, the Coffman–Graham algorithm is an algorithm, named after Edward G. Coffman, Jr. and Ronald Graham, for arranging the elements of a partially ordered set into a sequence of levels.
New!!: Partition refinement and Coffman–Graham algorithm · See more »
Collection (abstract data type)
In computer science, a collection or container is a grouping of some variable number of data items (possibly zero) that have some shared significance to the problem being solved and need to be operated upon together in some controlled fashion.
New!!: Partition refinement and Collection (abstract data type) · See more »
Complement (set theory)
In set theory, the complement of a set refers to elements not in.
New!!: Partition refinement and Complement (set theory) · See more »
Data structure
In computer science, a data structure is a data organization and storage format that enables efficient access and modification.
New!!: Partition refinement and Data structure · See more »
Deterministic finite automaton
In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton (DFA)—also known as a deterministic finite acceptor (DFA) and a deterministic finite state machine (DFSM) or a deterministic finite state automaton (DFSA)—is a finite-state machine that accepts or rejects strings of symbols and only produces a unique computation (or run) of the automaton for each input string.
New!!: Partition refinement and Deterministic finite automaton · See more »
DFA minimization
In automata theory (a branch of computer science), DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states.
New!!: Partition refinement and DFA minimization · See more »
Directed acyclic graph
In mathematics and computer science, a directed acyclic graph (DAG), is a finite directed graph with no directed cycles.
New!!: Partition refinement and Directed acyclic graph · See more »
Disjoint sets
In mathematics, two sets are said to be disjoint sets if they have no element in common.
New!!: Partition refinement and Disjoint sets · See more »
Disjoint-set data structure
In computer science, a disjoint-set data structure (also called a union–find data structure or merge–find set) is a data structure that tracks a set of elements partitioned into a number of disjoint (non-overlapping) subsets.
New!!: Partition refinement and Disjoint-set data structure · See more »
Doubly linked list
In computer science, a doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes.
New!!: Partition refinement and Doubly linked list · See more »
Finite-state machine
A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of computation.
New!!: Partition refinement and Finite-state machine · See more »
Graph theory
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
New!!: Partition refinement and Graph theory · See more »
Intersection (set theory)
In mathematics, the intersection A ∩ B of two sets A and B is the set that contains all elements of A that also belong to B (or equivalently, all elements of B that also belong to A), but no other elements.
New!!: Partition refinement and Intersection (set theory) · See more »
Lexicographic breadth-first search
In computer science, lexicographic breadth-first search or Lex-BFS is a linear time algorithm for ordering the vertices of a graph.
New!!: Partition refinement and Lexicographic breadth-first search · See more »
Lexicographical order
In mathematics, the lexicographic or lexicographical order (also known as lexical order, dictionary order, alphabetical order or lexicographic(al) product) is a generalization of the way words are alphabetically ordered based on the alphabetical order of their component letters.
New!!: Partition refinement and Lexicographical order · See more »
Neighbourhood (graph theory)
In graph theory, an adjacent vertex of a vertex v in a graph is a vertex that is connected to v by an edge.
New!!: Partition refinement and Neighbourhood (graph theory) · See more »
Partition of a set
In mathematics, a partition of a set is a grouping of the set's elements into non-empty subsets, in such a way that every element is included in one and only one of the subsets.
New!!: Partition refinement and Partition of a set · See more »
SIAM Journal on Computing
The SIAM Journal on Computing is a scientific journal focusing on the mathematical and formal aspects of computer science.
New!!: Partition refinement and SIAM Journal on Computing · See more »
Sigma-algebra
In mathematical analysis and in probability theory, a σ-algebra (also σ-field) on a set X is a collection Σ of subsets of X that includes the empty subset, is closed under complement, and is closed under countable unions and countable intersections.
New!!: Partition refinement and Sigma-algebra · See more »
Topological sorting
In the field of computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering.
New!!: Partition refinement and Topological sorting · See more »
References
[1] https://en.wikipedia.org/wiki/Partition_refinement
