Title :
A decomposition of a graph into dense subgraphs
fDate :
6/1/1985 12:00:00 AM
Abstract :
A density of a graph is defined as the maximum number of disjoint spanning trees of the graph. Using this density an algorithm to find all the subgraphs of a given density of a graph is developed. The decomposition is unique when a density is given. The algorithm is efficient.
Keywords :
Graph theory; Circuits and systems; Clustering algorithms; Computer networks; Computer science; Density measurement; Heuristic algorithms; Large-scale systems; Tree graphs; Very large scale integration;
Journal_Title :
Circuits and Systems, IEEE Transactions on
DOI :
10.1109/TCS.1985.1085757
