Bootstrap clustering for graph partitioning
From MaRDI portal
Publication:5388153
DOI10.1051/ro/2012001zbMath1238.05116WikidataQ58172965 ScholiaQ58172965MaRDI QIDQ5388153
Philippe Gambette, Alain Guénoche
Publication date: 18 April 2012
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222512
90C35: Programming involving graphs or networks
62F40: Bootstrap, jackknife and other resampling methods
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C22: Signed and weighted graphs
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two local dissimilarity measures for weighted graphs with application to protein interaction networks
- Consensus of partitions: a constructive approach
- Comparison of algorithms in graph partitioning
- Approximating Symmetric Relations by Equivalence Relations