Maximal independent set

From Wikipedia, the free encyclopedia
Jump to: navigation, search
This article is about the combinatorial aspects of maximal independent sets of vertices in a graph. For other aspects of independent vertex sets in graph theory, see Independent set (graph theory). For other kinds of independent sets, see Independent set (disambiguation).
The graph of the cube has six different maximal independent sets, shown as the red vertices.

In graph theory, a maximal independent set (MIS) or maximal stable set is an independent set that is not a subset of any other independent set. That is, it is a set S such that every edge of the graph has at least one endpoint not in S and every vertex not in S has at least one neighbor in S.

A MIS is also a dominating set in the graph, and every dominating set that is independent must be maximal independent, so MISs are also called independent dominating sets.

A graph may have many MISs of widely varying sizes;[1]

a largest MISs is called a maximum independent set.

For example, in the graph P3, a path with three vertices a, b, and c, and two edges ab and bc, the sets {b} and {a,c} are both maximally independent. The set {a} is independent, but is not maximal independent, because it is a subset of the larger independent set {a,c}. In this same graph, the maximal cliques are the sets {a,b} and {b,c}.

The phrase "maximal independent set" is also used to describe maximal subsets of independent elements in mathematical structures other than graphs, and in particular in vector spaces and matroids.

Two algorithmic problems are associated with MISs: finding a single MIS in a given graph and listing all MISs in a given graph.


Related vertex sets[edit]

If S is a maximal independent set in some graph, it is a maximal clique or maximal complete subgraph in the complementary graph. A maximal clique is a set of vertices that induces a complete subgraph, and that is not a subset of the vertices of any larger complete subgraph. That is, it is a set S such that every pair of vertices in S is connected by an edge and every vertex not in S is missing an edge to at least one vertex in S. A graph may have many maximal cliques, of varying sizes; finding the largest of these is the maximum clique problem.

Some authors include maximality as part of the definition of a clique, and refer to maximal cliques simply as cliques.

The complement of a maximal independent set, that is, the set of vertices not belonging to the independent set, forms a minimal vertex cover. That is, the complement is a vertex cover, a set of vertices that includes at least one endpoint of each edge, and is minimal in the sense that none of its vertices can be removed while preserving the property that it is a cover. Minimal vertex covers have been studied in statistical mechanics in connection with the hard-sphere lattice gas model, a mathematical abstraction of fluid-solid state transitions.[2]

Every maximal independent set is a dominating set, a set of vertices such that every vertex in the graph either belongs to the set or is adjacent to the set. A set of vertices is a maximal independent set if and only if it is an independent dominating set.

Graph family characterizations[edit]

Certain graph families have also been characterized in terms of their maximal cliques or maximal independent sets. Examples include the maximal-clique irreducible and hereditary maximal-clique irreducible graphs. A graph is said to be maximal-clique irreducible if every maximal clique has an edge that belongs to no other maximal clique, and hereditary maximal-clique irreducible if the same property is true for every induced subgraph.[3] Hereditary maximal-clique irreducible graphs include triangle-free graphs, bipartite graphs, and interval graphs.

Cographs can be characterized as graphs in which every maximal clique intersects every maximal independent set, and in which the same property is true in all induced subgraphs.

Bounding the number of sets[edit]

Moon & Moser (1965) showed that any graph with n vertices has at most 3n/3 maximal cliques. Complementarily, any graph with n vertices also has at most 3n/3 maximal independent sets. A graph with exactly 3n/3 maximal independent sets is easy to construct: simply take the disjoint union of n/3 triangle graphs. Any maximal independent set in this graph is formed by choosing one vertex from each triangle. The complementary graph, with exactly 3n/3 maximal cliques, is a special type of Turán graph; because of their connection with Moon and Moser's bound, these graphs are also sometimes called Moon-Moser graphs. Tighter bounds are possible if one limits the size of the maximal independent sets: the number of maximal independent sets of size k in any n-vertex graph is at most

\lfloor n/k \rfloor^{k-(n\bmod k)}\lfloor n/k+1 \rfloor^{n\bmod k}.

The graphs achieving this bound are again Turán graphs.[4]

Certain families of graphs may, however, have much more restrictive bounds on the numbers of maximal independent sets or maximal cliques. If all n-vertex graphs in a family of graphs have O(n) edges, and if every subgraph of a graph in the family also belongs to the family, then each graph in the family can have at most O(n) maximal cliques, all of which have size O(1).[5] For instance, these conditions are true for the planar graphs: every n-vertex planar graph has at most 3n − 6 edges, and a subgraph of a planar graph is always planar, from which it follows that each planar graph has O(n) maximal cliques (of size at most four). Interval graphs and chordal graphs also have at most n maximal cliques, even though they are not always sparse graphs.

The number of maximal independent sets in n-vertex cycle graphs is given by the Perrin numbers, and the number of maximal independent sets in n-vertex path graphs is given by the Padovan sequence.[6] Therefore, both numbers are proportional to powers of 1.324718, the plastic number.


Finding a single maximal independent set[edit]

Sequential algorithm[edit]

Given a graph G(V,E), it is easy to find a single MIS using the following algorithm:

  1. Initialize I to an empty set.
  2. While V is not empty:
    • Choose a node v∈V;
    • Add v to the set I;
    • Remove from V the node v and all its neighbours.
  3. Return I.

The runtime is O(n) since in the worst case we have to check all nodes.

O(n) is obviously the best possible runtime for a serial algorithm. But a parallel algorithm can solve the problem much faster.

Random-selection parallel algorithm[edit]

The following algorithm finds a MIS in time O(log n).[7][8][9]

  1. Initialize I to an empty set.
  2. While V is not empty:
    • Choose a random set of vertices S ⊆ V, by selecting each vertex v independently with probability 1/(2d(v)), where d is the degree of v (the number of neighbours of v).
    • For every edge in E, if both its endpoints are in the random set S, then remove from S the endpoint whose degree is lower (i.e. has fewer neighbours). Break ties arbitrarily, e.g. using a lexicographic order on the vertex names.
    • Add the set S to I.
    • Remove from V the set S and all the neighbours of nodes in S.
  3. Return I.

ANALYSIS: For each node v, divide its neighbours to lower neighbours (whose degree is lower than the degree of v) and higher neighbours (whose degree is lower than the degree of v), breaking ties as in the algorithm.

Call a node v bad if more than 2/3 of its neighbors are higher neighbours. Call an edge bad if both its endpoints are bad; otherwise the edge is good.

  • At least 1/2 of all edges are always good. PROOF: Build a directed version of G by directing each edge to the node with the higher degree (breaking ties arbitrarily). So for every bad node, the number of out-going edges is more than 2 times the number of in-coming edges. So every bad edge, that enters a node v, can be matched to a distinct set of two edges that exit the node v. Hence the total number of edges is at least 2 times the number of bad edges.
  • For every good node u, the probability that a neighbour of u is selected to S is at least a certain positive constant. PROOF: the probability that NO neighbour of u is selected to S is at most the probability that none of u's lower neighbours is selected. For each lower-neighbour v, the probability that it is not selected is (1-1/2d(v)), which is at most (1-1/2d(u)) (since d(u)≤d(v)). The number of such neighours is at least d(u)/3, since u is good. Hence the probability that no lower-neighbour is selected is at most 1-exp(-1/6).
  • For every node u that is selected to S, the probability that u will be removed from S is at most 1/2. PROOF: This probability is at most the probability that a higher-neighbour of u is selected to S. For each higher-neighbour v, the probability that it is selected is at most 1/2d(v), which is at most 1/2d(u) (since d(v)≤d(u)). By union bound, the probability that no higher-neighbour is selected is at most d(u)/2d(u) = 1/2.
  • Hence, for every good node u, the probability that a neighbour of u is selected to S and remains in S is a certain positive constant. Hence, the probability that u is removed, in each step, is at least a positive constant.
  • Hence, for every good edge e, the probability that e is removed, in each step, is at least a positive constant. So the number of good edges drops by at least a constant factor each step.
  • Since at least half the edges are good, the total number of edges also drops by a constant factor each step.
  • Hence, the number of steps is O(log m), where m is the number of edges. This is bounded by O(\log(n)).

A worst-case graph, in which the average number of steps is \Theta(\log(n)), is a graph made of n/2 connected components, each with 2 nodes. The degree of all nodes is 1, so each node is selected with probability 1/2, and with probability 1/4 both nodes in a component are not chosen. Hence, the number of nodes drops by a factor of 4 each step, and the expected number of steps is \log_4(n).

Random-priority parallel algorithm[edit]

The following algorithm is better than the previous one in that at least one new node is always added in each connected component:[10][9]

  1. Initialize I to an empty set.
  2. While V is not empty, each node v does the following:
    • Selects a random number r(v) in [0,1] and sends it to its neighbours;
    • If r(v) is smaller than the numbers of all neighbours of v, then v inserts itself into I, removes itself from V and tells its neighbours about this;
    • If v heard that one of its neighbours got into I, then v removes itself from V.
  3. Return I.

Note that in every step, the node with the smallest number in each connected component always enters I, so there is always some progress. In particular, in the worst-case of the previous algorithm (n/2 connected components with 2 nodes each), a MIS will be found in a single step.

ANALYSIS:

  • In each step, in expectation, half the edges are removed. PROOF: For every ordered pair of nodes (v,w), define the following event: r(v)<r(w), and for every neighbour x of w, also r(v)<r(x). The probability of this event is at least 1/[d(v)+d(w)]. If this event happens then all neighbours of w are removed; hence the expected number of edges removed due to this event is at least d(w)/[d(v)+d(w)]. The same is true for the reverse pair (w,v), i.e. the expected number of edges removed is at least d(v)/[d(w)+d(v)]. Hence, for every undirected edge w-v, the expected number of edges removed due to one of these nodes having a small value is [d(w)+d(v)]/[d(v)+d(w)] = 1. Summing over all edges gives an expected number of |E| edges removed every step, but each edge is counted twice (once per direction).
  • Hence, the expected run time of the algorithm is 3 \log_{4/3}(m)+1 which is O(\log(n)).[9]


Random-permutation parallel algorithm[edit]

Instead of randomizing in each step, it is possible to randomize once, at the beginning of the algorithm, by fixing a random ordering on the nodes. Given this fixed ordering, the following parallel algorithm achieves exactly the same MIS as the #Sequential algorithm (i.e. the result is deterministic):[11]

  1. Initialize I to an empty set.
  2. While V is not empty:
    • Let W be the set of vertices in V with no earlier neighbours (based on the fixed ordering);
    • Add W to I;
    • Remove from V the nodes in the set W and all their neighbours.
  3. Return I.

Between the totally sequential and the totally parallel algorithms, there is a continuum of algorithms that are partly sequential and partly parallel. Given a fixed ordering on the nodes and a factor δ∈(0,1], the following algorithm returns the same MIS:

  1. Initialize I to an empty set.
  2. While V is not empty:
    • Select a factor δ∈(0,1].
    • Let P be the set of δn nodes that are first in the fixed ordering.
    • Let W be a MIS on P using the totally parallel algorithm.
    • Add W to I;
    • Remove from V all the nodes in the prefix P, and all the neighbours of nodes in the set W.
  3. Return I.

Setting δ=1/n gives the totally sequential algorithm; setting δ=1 gives the totally parallel algorithm.

ANALYSIS: With a proper selection of the parameter δ in the partially parallel algorithm, it is possible to guarantee that the it finishes after at most log(n) calls to the fully parallel algorithm, and the number of steps in each call is at most log(n). Hence the total run-time of the partially parallel algorithm is O(\log^2(n)). Hence the run-time of the fully parallel algorithm is also at most O(\log^2(n)). The main proof steps are:

  • If, in step i, we select \delta = 2^i \log{(n)} / D, where D is the maximum degree of a node in the graph, then WHP all nodes remaining after step i have degree at most D / 2^i. Thus, after log(D) steps, all remaining nodes have degree 0 (since D<n), and can be removed in a single step.
  • If, in any step, the degree of each node is at most d, and we select \delta =  C \log{(n)}/d (for any constant C), then WHP the longest path in the directed graph determined by the fixed ordering has length O(\log(n)). Hence the fully parallel algorithm takes at most O(\log(n)) steps (since the longest path is a worst-case bound on the number of steps in that algorithm).
  • Combining these two facts gives that, if we select \delta = 2^i \log{(n)} / D, then WHP the run-time of the partially parallel algorithm is O(\log(D)\log(n)) = O(\log^2(n)).

Listing all maximal independent sets[edit]

An algorithm for listing all maximal independent sets or maximal cliques in a graph can be used as a subroutine for solving many NP-complete graph problems. Most obviously, the solutions to the maximum independent set problem, the maximum clique problem, and the minimum independent dominating problem must all be maximal independent sets or maximal cliques, and can be found by an algorithm that lists all maximal independent sets or maximal cliques and retains the ones with the largest or smallest size. Similarly, the minimum vertex cover can be found as the complement of one of the maximal independent sets. Lawler (1976) observed that listing maximal independent sets can also be used to find 3-colorings of graphs: a graph can be 3-colored if and only if the complement of one of its maximal independent sets is bipartite. He used this approach not only for 3-coloring but as part of a more general graph coloring algorithm, and similar approaches to graph coloring have been refined by other authors since.[12] Other more complex problems can also be modeled as finding a clique or independent set of a specific type. This motivates the algorithmic problem of listing all maximal independent sets (or equivalently, all maximal cliques) efficiently.

It is straightforward to turn a proof of Moon and Moser's 3n/3 bound on the number of maximal independent sets into an algorithm that lists all such sets in time O(3n/3).[13] For graphs that have the largest possible number of maximal independent sets, this algorithm takes constant time per output set. However, an algorithm with this time bound can be highly inefficient for graphs with more limited numbers of independent sets. For this reason, many researchers have studied algorithms that list all maximal independent sets in polynomial time per output set.[14] The time per maximal independent set is proportional to that for matrix multiplication in dense graphs, or faster in various classes of sparse graphs.[15]

Notes[edit]

  1. ^ Erdős (1966) shows that the number of different sizes of MISs in an n-vertex graph may be as large as n - log n - O(log log n) and is never larger than n - log n.
  2. ^ Weigt & Hartmann (2001).
  3. ^ Information System on Graph Class Inclusions: maximal clique irreducible graphs and hereditary maximal clique irreducible graphs.
  4. ^ Byskov (2003). For related earlier results see Croitoru (1979) and Eppstein (2003).
  5. ^ Chiba & Nishizeki (1985). Chiba and Nishizeki express the condition of having O(n) edges equivalently, in terms of the arboricity of the graphs in the family being constant.
  6. ^ Bisdorff & Marichal (2007); Euler (2005); Füredi (1987).
  7. ^ Luby’s Algorithm, in: Lecture Notes for Randomized Algorithms, Last Updated by Eric Vigoda on February 2, 2006
  8. ^ Luby, M. (1986). "A Simple Parallel Algorithm for the Maximal Independent Set Problem". SIAM Journal on Computing 15 (4): 1036. doi:10.1137/0215074.  edit
  9. ^ a b c "Principles of Distributed Computing (lecture 7)". ETH Zurich. Retrieved 21 February 2015. 
  10. ^ Métivier, Y.; Robson, J. M.; Saheb-Djahromi, N.; Zemmari, A. (2010). "An optimal bit complexity randomized distributed MIS algorithm". Distributed Computing 23 (5–6): 331. doi:10.1007/s00446-010-0121-5.  edit
  11. ^ Blelloch, Guy; Fineman, Jeremy; Shun, Julian (2012). "Greedy Sequential Maximal Independent Set and Matching are Parallel on Average". arXiv:1202.3205 [cs.DS]. 
  12. ^ Eppstein (2003); Byskov (2003).
  13. ^ Eppstein (2003). For a matching bound for the widely used Bron–Kerbosch algorithm, see Tomita, Tanaka & Takahashi (2006).
  14. ^ Bomze et al. (1999); Eppstein (2005); Jennings & Motycková (1992); Johnson, Yannakakis & Papadimitriou (1988); Lawler, Lenstra & Rinnooy Kan (1980); Liang, Dhall & Lakshmivarahan (1991); Makino & Uno (2004); Mishra & Pitt (1997); Stix (2004); Tsukiyama et al. (1977); Yu & Chen (1993).
  15. ^ Makino & Uno (2004); Eppstein (2005).

References[edit]