# A Brief Summary of Independent Set in Graph Theory

**Posted:**April 24, 2010

**Filed under:**Research |

**Tags:**coloring problem, dominating set, graph, graph coloring, independent set, maximal independent set, maximum independent set, mis 1 Comment

### Graph Basics

Let *G* be a undirected graph. *G=(V,E)*, where *V* is a set of vertices and *E* is a set of edges. Every edge *e *in* E *consists of two vertices in *V *of* G. *It is said to connect, join, or link the two vertices (or end points).

### Independent Set

An independent set *S* is a subset of *V* in *G* such that no two vertices in *S* are adjacent. I suppose that its name is meaning that vertices in an independent set *S* is independent on a set of edges in a graph *G*. Like other vertex sets in graph theory, independent set has maximal and maximum sets as follows:

The independent set

Sisis not a proper subset of any independent set ofmaximalif SG.

The independent set

Sisif there is no other independent set has more vertices thanmaximumS.

That is, a largest maximal independent set is called a maximum independent set. The maximum independent set problem is an NP-hard optimization problem.

All graphs has independent sets. For a graph *G* having a maximum independent set, the independence number *α*(*G*) is determined by the cardinality of a maximum independent set.

**Relations to Dominating Sets**

- A dominating set in a graph
*G*is a subset*D*of*V*such that every vertex not in*D*is joined to at least one member of*D*by some edge. - In other words, a vertex set
*D*is a dominating set in*G*if and if only every vertex in a graph*G*is contained in (or is adjacent to) a vertex in*D.* - Every maximal independent set
*S*of vertices in a simple graph*G*has the property that every vertex of the graph either is contained in*S*or is adjacent to a vertex in*S*.- That is, an independent set is a dominating set if and if only it is a maximal independent set.

### Relations to Graph Coloring

- Independent set problem is related to coloring problem since vertices in an independent set can have the same color.

### References

- Chapter 10, Graph Theory: Modeling, Applications, and Algorithms
- http://en.wikipedia.org/wiki/Independent_set_(graph_theory)
- http://en.wikipedia.org/wiki/Dominating_set

# Data-Intensive Text Processing with MapReduce Draft Available in Online

**Posted:**March 11, 2010

**Filed under:**News, Research |

**Tags:**data intensive, graph, hadoop, mapreduce, text processing Leave a comment

Data-Intensive Text Processing with MapReduce, Jimmy Lin and Chris Dyer

Actually, there have never been books that directly deal with MapReduce programming and algorithms. This book addresses from MapReduce algorithm design to EM Algorithms for Text Processing. Although this book is still draft, it seems well-organized and very interesting. In addition, the book contains some basic graph algorithms using MapReduce.

# Java Universal Network/Graph Framework

**Posted:**September 15, 2009

**Filed under:**Research |

**Tags:**graph, java, jung, visualization tools 2 Comments

Recently, I’m primarily concerned with large-scale graph data processing. Occasionally, the visualization of graph can be a good way for us to observe some properties from graph data sets. Today, I’m going to introduce a graph framework, called *Java Universal Network/Graph Framework (Jung). *Jung provides data structures for graph, a programming interface familiar with graph features, some fundamental graph algorithms (e.g., minimum spanning tree, depth-first search, breath-first search, and dijkstra algorithm), and even visualization methods. Especially, I’m interested in its visualization methods.

The following java source shows the programming interface of Jung. In more detail, this program make a graph, add three vertices to the graph, and connect vertices. This source code is brought from Jung tutorial. As you can see, Jung’s APIs are very easy.

// Make a graph by a SparseMultigraph instance. Graph<Integer, String> g = new SparseMultigraph<Integer, String>(); g.addVertex((Integer)1); // Add a vertex with an integer 1 g.addVertex((Integer)2); g.addVertex((Integer)3); g.addEdge("Edge-A", 1,3); // Added an edge to connect between 1 and 3 vertices. g.addEdge("Edge-B", 2,3, EdgeType.DIRECTED); g.addEdge("Edge-C", 3, 2, EdgeType.DIRECTED); g.addEdge("Edge-P", 2,3); // A parallel edge // Make some objects for graph layout and visualization. Layout<Integer, String> layout = new KKLayout<Integer, String>(g); BasicVisualizationServer<Integer, String> vv = new BasicVisualizationServer<Integer, String>(layout); vv.setPreferredSize(new Dimension(800,800)); // It determine how each vertex with its value is represented in a diagram. ToStringLabeller<Integer> vertexPaint = new ToStringLabeller<Integer>() { public String transform(Integer i) { return ""+i; } }; vv.getRenderContext().setVertexLabelTransformer(vertexPaint); JFrame frame = new JFrame("Simple Graph View"); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); frame.getContentPane().add(vv); frame.pack(); frame.setVisible(true);

Some APIs of the Jung are based on generic programming, so you can use easily vertices or edges to contains user-defined data. If you want more detail information, visit http://jung.sourceforge.net.

The above source code shows the following diagram.