============================================================================
     Title: Degree bounded spanning tree
   Authors: L. Liu <lliu1@cs.uky.edu>, G. Namasivayam <gayathri@cs.uky.edu>
            and M. Truszczynski <mirek@cs.uky.edu>
            Department of Computer Science, University of Kentucky
	    Lexington, KY, USA
   Version: 0.1
  Category: SAT/UNSAT (all instances are satisfiable)
# of files: 15
============================================================================
Let G=(V,E) be an undirected graph. Function w : V x V -> N assigns
non-negative integer weights to edges in G. A spanning tree T=(V,E') 
is a d-bounded spanning tree if, for every vertex v in V, the following 
is true: 
	\sum_{(v,u)\in E} w(v,u) <= d

We generated 15 random graphs. They are:
* 5 graphs having 30 vertices and 350 edges with d=15
* 5 graphs having 40 vertices and 600 edges with d=20 
* 5 graphs having 50 vertices and 1000 edges with d=25.

The weights of edges are between 1 and 9.