Партиционисање графа (Serbian Wikipedia)
Analysis of information sources in references of the Wikipedia article "Партиционисање графа" in Serbian language version.
refsWebsite
Global rank
Serbian rank
4,730th place
2,727th place
arxiv.org
- Buluc, Aydin; Meyerhenke, Henning; Safro, Ilya; Sanders, Peter; Schulz, Christian (2013). Recent Advances in Graph Partitioning. arXiv:1311.3144
.
doi.org
- Andreev, Konstantin & Räcke, Harald (2004). „Balanced Graph Partitioning”. Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures. Barcelona, Spain: 120—124. ISBN 978-1-58113-840-5. doi:10.1145/1007912.1007931.
- Karypis, G. & Kumar, V. (1999). „A fast and high quality multilevel scheme for partitioning irregular graphs”. SIAM Journal on Scientific Computing. 20 (1): 359. doi:10.1137/S1064827595287997.
- Newman, M. E. J. (2006). „Modularity and community structure in networks”. PNAS. 103 (23): 8577—8696. PMC 1482622 . PMID 16723398. doi:10.1073/pnas.0601602103.
- Aldecoa, Rodrigo & Ignacio Marín (2011). „Deciphering network community structure by Surprise”. PLoS ONE. 6 (9): e24195. PMC 3164713 . PMID 21909420. doi:10.1371/journal.pone.0024195.
- Reichardt, Jörg & Bornholdt, Stefan (јул 2006). „Statistical mechanics of community detection”. Phys. Rev. E. 74 (1): 016110. doi:10.1103/PhysRevE.74.016110.
- Chevalier, C. & Pellegrini, F. (2008). „PT-Scotch: A Tool for Efficient Parallel Graph Ordering”. Parallel Computing. 34 (6): 318—331. doi:10.1016/j.parco.2007.12.001.
- Walshaw, C. & Cross, M. (2000). „Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm”. Journal on Scientific Computing. 22 (1): 63—80. doi:10.1137/s1064827598337373.
- R. Diekmann, R. Preis, F. Schlimbach and C. Walshaw (2000). „Shape-optimized Mesh Partitioning and Load Balancing for Parallel Adaptive FEM”. Parallel Computing. 26 (12): 1555—1581. doi:10.1016/s0167-8191(00)00043-0.
- H. Meyerhenke and B. Monien and T. Sauerwald (2008). „A New Diffusion-Based Multilevel Algorithm for Computing Graph Partitions”. Journal of Parallel Computing and Distributed Computing. 69 (9): 750—761. doi:10.1016/j.jpdc.2009.04.005.
- Trifunovic, A. & Knottenbelt, W. J. (2008). „Parallel Multilevel Algorithms for Hypergraph Partitioning”. Journal of Parallel and Distributed Computing. 68 (5): 563—581. doi:10.1016/j.jpdc.2007.11.002.
nih.gov
ncbi.nlm.nih.gov
- Newman, M. E. J. (2006). „Modularity and community structure in networks”. PNAS. 103 (23): 8577—8696. PMC 1482622 . PMID 16723398. doi:10.1073/pnas.0601602103.
- Aldecoa, Rodrigo & Ignacio Marín (2011). „Deciphering network community structure by Surprise”. PLoS ONE. 6 (9): e24195. PMC 3164713 . PMID 21909420. doi:10.1371/journal.pone.0024195.
plosone.org
- Aldecoa, Rodrigo & Ignacio Marín (2011). „Deciphering network community structure by Surprise”. PLoS ONE. 6 (9): e24195. PMC 3164713 . PMID 21909420. doi:10.1371/journal.pone.0024195.