A decomposition of a graph into dense subgraphs

DOI10.1109/TCS.1985.1085757MaRDI QIDQ3697029zbMATH OpenFDO

Authors Shunichi Toida

Publication date 1985

Published in IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TCS.1985.1085757

zbMATH Keywords

algorithmdensity of a graphsubgraphs

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Determination of the densest subgraph
• On Finding Dense Subgraphs
• In search of the densest subgraph
• Finding Connected Dense k-Subgraphs
• Finding dense subgraphs

Cited in

(5)

• Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem
• Strength and reinforcement of a network and tree packing
• Decomposing large graphs with small graphs of high density
• Clustering, community partition and disjoint spanning trees
• Evolutionary approach to obtain graph covering by densely connected subgraphs

This page was built for publication: A decomposition of a graph into dense subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3697029)