Content deleted Content added
Rescuing 2 sources and tagging 1 as dead.) #IABot (v2.0.9.5 |
→Suitability: deadlink is recoverable at https://bccdev.ime.usp.br/tccs/2011/edson/pdfs/Genealogia%20Acad%c3%aamica%20Lattes%20-%20monografia.pdf but is a bachelor's thesis (not reliable) so just remove its claim |
||
| (4 intermediate revisions by 4 users not shown) | |||
Line 43:
==Suitability==
Graph-tool can be used to work with very large graphs {{clarify|date=January 2021 |reason= Be more precise? Size of graph you can use depends strongly on context.}} in a variety of contexts, including simulation of [[epithelium|cellular tissue]],<ref>Bruno Monier et al, "Apico-basal forces exerted by apoptotic cells drive epithelium folding", Nature, 2015 [http://www.nature.com/nature/journal/vaop/ncurrent/full/nature14152.html]</ref> [[data mining]],<ref>Ma, Shuai, et al. "Distributed graph pattern matching." Proceedings of the 21st international conference on World Wide Web. ACM, 2012. [http://dl.acm.org/citation.cfm?id=2187963]</ref><ref>Ma, Shuai, et al. "Capturing topology in graph pattern matching." Proceedings of the VLDB Endowment 5.4 (2011): 310-321. [http://dl.acm.org/citation.cfm?id=2095690]</ref> [[Social network analysis|analysis of social networks]],<ref>Janssen, E., M. A. T. T. Hurshman, and N. A. U. Z. E. R. Kalyaniwalla. "Model selection for social networks using graphlets." Internet Mathematics (2012). [http://www.mathstat.dal.ca/~janssen/papers/Graphlets.pdf]</ref><ref>Asadi, Hirad Cyrus. Design and implementation of a middleware for data analysis of social networks. Diss. M Sc thesis report, KTH School of Computer Science and Communication, Stockholm, Sweden, 2007. [http://www.student.nada.kth.se/~hias02/xjobb-en.pdf] {{Webarchive|url=https://web.archive.org/web/20150122120734/http://www.student.nada.kth.se/~hias02/xjobb-en.pdf |date=2015-01-22 }}</ref> analysis of [[Peer-to-peer|P2P]] systems,<ref>Teresniak, Sven, et al. "Information-Retrieval in einem P2P-Netz mit Small-World-Eigenschaften Simulation und Evaluation des SemPIR-Modells."[http://asv.informatik.uni-leipzig.de/thesis/thesis_document/25/masterarbeit.pdf] {{Webarchive|url=https://web.archive.org/web/20150122120956/http://asv.informatik.uni-leipzig.de/thesis/thesis_document/25/masterarbeit.pdf |date=2015-01-22 }}</ref> large-scale modeling of [[Agent-based model|agent-based systems]],<ref>Hamacher, Kay, and Stefan Katzenbeisser. "Public security: simulations need to replace conventional wisdom." Proceedings of the 2011 workshop on New security paradigms workshop. ACM, 2011. [http://dl.acm.org/citation.cfm?id=2073288]</ref> theoretical assessment and modeling of network [[Clustering coefficient|clustering]],<ref>Abdo, Alexandre H., and A. P. S. de Moura. "Clustering as a measure of the local topology of networks." arXiv preprint physics/0605235 (2006). [https://arxiv.org/abs/physics/0605235]</ref> large-scale [[call graph]] analysis,<ref>Narayan, Ganesh, K. Gopinath, and V. Sridhar. "Structure and interpretation of computer programs." Theoretical Aspects of Software Engineering, 2008. TASE'08. 2nd IFIP/IEEE International Symposium on. IEEE, 2008. [https://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4549888]</ref> and analysis of the brain's [[Connectome]].<ref>Gerhard, Stephan, et al. "The connectome viewer toolkit: an open source framework to manage, analyze, and visualize connectomes." Frontiers in neuroinformatics 5 (2011). [https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3112315/]</ref>
==References==
| |||