## Calculate a minimum spanning tree with Python

This article presents how to calculate a minimum spanning tree with the Python package, NetworkX.

## Calculate a maximal independent set with Python

This article presents how to calculate a maximal independent set with the Python package, NetworkX.

## NetworkX Application Notes: Draw trees with pygraphviz

NetworkX only provides basic functionality for visualizing graphs. It looks ugly to draw trees with its built-in graph layout. This article presents how to draw beautiful trees with pygraphviz and convert the format between NetworkX and Graphviz (dot).

## NetworkX Application Notes: A better way to visualize graphs

NetworkX is not powerful enough to draw large graphs since it only provides basic functionality for visualizing graphs. This article presents a better way to visualize graphs, i.e. using layouts in Gephi.

## Calculate connected dominating sets (CDS)

It is believed that the minimum connected dominating set problem cannot be solved in polynomial time. To the best of my knowledge, there is no source code available for approximation algorithms. Therefore, I decide to implement one proposed by M. Rai in 2009.

## Calculate minimum dominating sets

This blog takes notes of dominating sets and shows how to calculate its value with the Python package, NetworkX.

## NetworkX Application Notes: Draw a graph with matplotlib

This article takes notes from my experiences of drawing a graph with the python 2D plotting library, matplotlib.