Bootstrap clustering for graph partitioning
From MaRDI portal
Publication:5388153
Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Bootstrap, jackknife and other resampling methods (62F40) Programming involving graphs or networks (90C35)
Recommendations
Cites work
- Approximating Symmetric Relations by Equivalence Relations
- Comparison of algorithms in graph partitioning
- Consensus of partitions: a constructive approach
- scientific article; zbMATH DE number 3874429 (Why is no real title available?)
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 1104922 (Why is no real title available?)
- scientific article; zbMATH DE number 745864 (Why is no real title available?)
- Two local dissimilarity measures for weighted graphs with application to protein interaction networks
Cited in
(3)
This page was built for publication: Bootstrap clustering for graph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388153)