scientific article; zbMATH DE number 842029

zbMATH0842.68056MaRDI QIDQ4862250FDOQ4862250

Authors Muralidhar Medidi

Publication date 29 July 1996

zbMATH Keywords

clusteringminimum spanning treeweighted graphdesign of algorithms

Mathematics Subject Classification ID

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

Recommendations

• A fast algorithm for finding the compact sets
• An optimal algorithm for finding compact sets
• A better sets approach algorithm for the determination of component minimal complete subgraph
• Compact graphs and the deterministic algorithm for their synthesis
• A note on finding compact sets in graphs represented by an adjacency list

Cited in

(4)

• Adjacency Method for Finding Connected Subsets of a Graph: An Application of Graph Theory to Spatial Statistics
• An optimal algorithm for finding compact sets
• On the structure of compact graphs
• A fast algorithm for finding the compact sets

This page was built for publication:

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