- Published 2008 in Ubiquity
DOI:10.1145/1366313.1361266

Most of the physical and mathematical problems can be formulated in terms of Graph Theory [1]. Generation of a single spanning tree for a simple, symmetric and connected graph G is well known polynomial time solvable problem [1]. Also there are some intractable problems like Graph Coloring, Vertex Connectivity, Isomorphism etc. in graph theory [2,3]. To… CONTINUE READING

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=1361266.

### Presentations referencing similar topics