Faster access than browser!
45 relations: Algorithm, Arboricity, Babeș-Bolyai University, Bipartite graph, Bron–Kerbosch algorithm, Chordal graph, Clique problem, Cograph, Complement (set theory), Complement graph, Complete graph, Computer cluster, Cycle graph, Dense graph, Distributed algorithm, Dominating set, Graph theory, Hard spheres, Independent set (graph theory), Induced subgraph, Interval graph, Journal of Graph Algorithms and Applications, Matching (graph theory), Matrix multiplication, Matroid, Morgan Kaufmann Publishers, NC (complexity), P-complete, Padovan sequence, Parallel algorithm, Parallel random-access machine, Path (graph theory), Perrin number, Planar graph, Plastic number, Set packing, Statistical mechanics, Theoretical Computer Science (journal), Triangle-free graph, Turán graph, Vector space, Vertex cover, Well-covered graph, With high probability, 2-satisfiability.
Algorithm
In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.
New!!: Maximal independent set and Algorithm · See more »
Arboricity
The arboricity of an undirected graph is the minimum number of forests into which its edges can be partitioned.
New!!: Maximal independent set and Arboricity · See more »
Babeș-Bolyai University
The Babeș-Bolyai University (Universitatea Babeș-Bolyai, Babeș-Bolyai Tudományegyetem, Babeș-Bolyai Universität), commonly known after its abbreviation, UBB, is a public university in Cluj-Napoca, Romania.
New!!: Maximal independent set and Babeș-Bolyai University · See more »
Bipartite graph
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V such that every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the parts of the graph.
New!!: Maximal independent set and Bipartite graph · See more »
Bron–Kerbosch algorithm
In computer science, the Bron–Kerbosch algorithm is an algorithm for finding maximal cliques in an undirected graph.
New!!: Maximal independent set and Bron–Kerbosch algorithm · 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!!: Maximal independent set and Chordal graph · See more »
Clique problem
In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete subgraphs) in a graph.
New!!: Maximal independent set and Clique problem · See more »
Cograph
In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation and disjoint union.
New!!: Maximal independent set and Cograph · See more »
Complement (set theory)
In set theory, the complement of a set refers to elements not in.
New!!: Maximal independent set and Complement (set theory) · See more »
Complement graph
In graph theory, the complement or inverse of a graph is a graph on the same vertices such that two distinct vertices of are adjacent if and only if they are not adjacent in.
New!!: Maximal independent set and Complement graph · See more »
Complete graph
No description.
New!!: Maximal independent set and Complete graph · See more »
Computer cluster
A computer cluster is a set of loosely or tightly connected computers that work together so that, in many respects, they can be viewed as a single system.
New!!: Maximal independent set and Computer cluster · See more »
Cycle graph
In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices connected in a closed chain.
New!!: Maximal independent set and Cycle graph · See more »
Dense graph
In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges.
New!!: Maximal independent set and Dense graph · See more »
Distributed algorithm
A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors.
New!!: Maximal independent set and Distributed algorithm · See more »
Dominating set
In graph theory, a dominating set for a graph G.
New!!: Maximal independent set and Dominating set · 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!!: Maximal independent set and Graph theory · See more »
Hard spheres
Hard spheres are widely used as model particles in the statistical mechanical theory of fluids and solids.
New!!: Maximal independent set and Hard spheres · See more »
Independent set (graph theory)
In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent.
New!!: Maximal independent set and Independent set (graph theory) · See more »
Induced subgraph
In graph theory, an induced subgraph of a graph is another graph, formed from a subset of the vertices of the graph and all of the edges connecting pairs of vertices in that subset.
New!!: Maximal independent set and Induced subgraph · See more »
Interval graph
In graph theory, an interval graph is the intersection graph of a family of intervals on the real line.
New!!: Maximal independent set and Interval graph · See more »
Journal of Graph Algorithms and Applications
The Journal of Graph Algorithms and Applications is an open access peer-reviewed scientific journal covering the subject of graph algorithms and graph drawing.
New!!: Maximal independent set and Journal of Graph Algorithms and Applications · See more »
Matching (graph theory)
In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices.
New!!: Maximal independent set and Matching (graph theory) · See more »
Matrix multiplication
In mathematics, matrix multiplication or matrix product is a binary operation that produces a matrix from two matrices with entries in a field, or, more generally, in a ring or even a semiring.
New!!: Maximal independent set and Matrix multiplication · See more »
Matroid
In combinatorics, a branch of mathematics, a matroid is a structure that abstracts and generalizes the notion of linear independence in vector spaces.
New!!: Maximal independent set and Matroid · See more »
Morgan Kaufmann Publishers
Morgan Kaufmann Publishers is a Burlington, Massachusetts (San Francisco, California until 2008) based publisher specializing in computer science and engineering content.
New!!: Maximal independent set and Morgan Kaufmann Publishers · See more »
NC (complexity)
In complexity theory, the class NC (for "Nick's Class") is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors.
New!!: Maximal independent set and NC (complexity) · See more »
P-complete
In complexity theory, a decision problem is P-complete (complete for the complexity class '''P''') if it is in P and every problem in P can be reduced to it by an appropriate reduction.
New!!: Maximal independent set and P-complete · See more »
Padovan sequence
The Padovan sequence is the sequence of integers P(n) defined by the initial values and the recurrence relation The first few values of P(n) are The Padovan sequence is named after Richard Padovan who attributed its discovery to Dutch architect Hans van der Laan in his 1994 essay Dom.
New!!: Maximal independent set and Padovan sequence · See more »
Parallel algorithm
In computer science, a parallel algorithm, as opposed to a traditional serial algorithm, is an algorithm which can be executed a piece at a time on many different processing devices, and then combined together again at the end to get the correct result.
New!!: Maximal independent set and Parallel algorithm · See more »
Parallel random-access machine
In computer science, a parallel random-access machine (PRAM) is a shared-memory abstract machine.
New!!: Maximal independent set and Parallel random-access machine · See more »
Path (graph theory)
In graph theory, a path in a graph is a finite or infinite sequence of edges which connect a sequence of vertices which, by most definitions, are all distinct from one another.
New!!: Maximal independent set and Path (graph theory) · See more »
Perrin number
In mathematics, the Perrin numbers are defined by the recurrence relation with initial values The sequence of Perrin numbers starts with The number of different maximal independent sets in an -vertex cycle graph is counted by the th Perrin number for.
New!!: Maximal independent set and Perrin number · See more »
Planar graph
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints.
New!!: Maximal independent set and Planar graph · See more »
Plastic number
In mathematics, the plastic number (also known as the plastic constant, the minimal Pisot number, the platin number, Siegel's number or, in French, le nombre radiant) is a mathematical constant which is the unique real solution of the cubic equation It has the exact value Its decimal expansion begins with.
New!!: Maximal independent set and Plastic number · See more »
Set packing
Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems.
New!!: Maximal independent set and Set packing · See more »
Statistical mechanics
Statistical mechanics is one of the pillars of modern physics.
New!!: Maximal independent set and Statistical mechanics · See more »
Theoretical Computer Science (journal)
Theoretical Computer Science (TCS) is a computer science journal published by Elsevier, started in 1975 and covering theoretical computer science.
New!!: Maximal independent set and Theoretical Computer Science (journal) · See more »
Triangle-free graph
In the mathematical area of graph theory, a triangle-free graph is an undirected graph in which no three vertices form a triangle of edges.
New!!: Maximal independent set and Triangle-free graph · See more »
Turán graph
No description.
New!!: Maximal independent set and Turán graph · See more »
Vector space
A vector space (also called a linear space) is a collection of objects called vectors, which may be added together and multiplied ("scaled") by numbers, called scalars.
New!!: Maximal independent set and Vector space · See more »
Vertex cover
In the mathematical discipline of graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set.
New!!: Maximal independent set and Vertex cover · See more »
Well-covered graph
In graph theory, a well-covered graph is an undirected graph in which every minimal vertex cover has the same size as every other minimal vertex cover.
New!!: Maximal independent set and Well-covered graph · See more »
With high probability
In mathematics, an event that occurs with high probability (often shortened to w.h.p. or WHP) is one whose probability depends on a certain number n and goes to 1 as n goes to infinity, i.e. it can be made as close as desired to 1 by making n big enough.
New!!: Maximal independent set and With high probability · See more »
2-satisfiability
In computer science, 2-satisfiability, 2-SAT or just 2SAT is a computational problem of assigning values to variables, each of which has two possible values, in order to satisfy a system of constraints on pairs of variables.
New!!: Maximal independent set and 2-satisfiability · See more »
Redirects here:
Minimum independent dominating set, Minimum maximal independent set, Minimum maximal indepent set.
References
[1] https://en.wikipedia.org/wiki/Maximal_independent_set
