DocumentCode
1192952
Title
A decomposition of a graph into dense subgraphs
Author
Toida, Shunichi
Volume
32
Issue
6
fYear
1985
fDate
6/1/1985 12:00:00 AM
Firstpage
583
Lastpage
589
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;
fLanguage
English
Journal_Title
Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0098-4094
Type
jour
DOI
10.1109/TCS.1985.1085757
Filename
1085757
Link To Document