Добірка наукової літератури з теми "Large graph"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Large graph".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Large graph"
Ji, Shengwei, Chenyang Bu, Lei Li, and Xindong Wu. "Local Graph Edge Partitioning." ACM Transactions on Intelligent Systems and Technology 12, no. 5 (October 31, 2021): 1–25. http://dx.doi.org/10.1145/3466685.
Повний текст джерелаBurch, Michael. "Visual analytics of large dynamic digraphs." Information Visualization 16, no. 3 (August 3, 2016): 167–78. http://dx.doi.org/10.1177/1473871616661194.
Повний текст джерелаAristoff, David, and Charles Radin. "Emergent Structures in Large Networks." Journal of Applied Probability 50, no. 3 (September 2013): 883–88. http://dx.doi.org/10.1239/jap/1378401243.
Повний текст джерелаAristoff, David, and Charles Radin. "Emergent Structures in Large Networks." Journal of Applied Probability 50, no. 03 (September 2013): 883–88. http://dx.doi.org/10.1017/s0021900200009918.
Повний текст джерелаWichianpaisarn, Tanawat, and Chariya Uiyyasathian. "Graphs with large clique-chromatic numbers." Discrete Mathematics, Algorithms and Applications 07, no. 04 (December 2015): 1550055. http://dx.doi.org/10.1142/s179383091550055x.
Повний текст джерелаWong, Pak Chung, Harlan Foote, Patrick Mackey, George Chin, Heidi Sofia, and Jim Thomas. "A Dynamic Multiscale Magnifying Tool for Exploring Large Sparse Graphs." Information Visualization 7, no. 2 (April 17, 2008): 105–17. http://dx.doi.org/10.1057/palgrave.ivs.9500177.
Повний текст джерелаFerber, Asaf, Kyle Luh, and Oanh Nguyen. "Embedding large graphs into a random graph." Bulletin of the London Mathematical Society 49, no. 5 (July 10, 2017): 784–97. http://dx.doi.org/10.1112/blms.12066.
Повний текст джерелаMa, Yuliang, Ye Yuan, Meng Liu, Guoren Wang, and Yishu Wang. "Graph simulation on large scale temporal graphs." GeoInformatica 24, no. 1 (November 30, 2019): 199–220. http://dx.doi.org/10.1007/s10707-019-00381-y.
Повний текст джерелаWagenpfeil, Stefan, Binh Vu, Paul Mc Kevitt, and Matthias Hemmje. "Fast and Effective Retrieval for Large Multimedia Collections." Big Data and Cognitive Computing 5, no. 3 (July 22, 2021): 33. http://dx.doi.org/10.3390/bdcc5030033.
Повний текст джерелаEl Moussawi, Adnan, Nacera Bennacer Seghouani, and Francesca Bugiotti. "BGRAP: Balanced GRAph Partitioning Algorithm for Large Graphs." Journal of Data Intelligence 2, no. 2 (June 2021): 116–35. http://dx.doi.org/10.26421/jdi2.2-2.
Повний текст джерелаДисертації з теми "Large graph"
Henry, Tyson Rombauer. "Interactive graph layout: The exploration of large graphs." Diss., The University of Arizona, 1992. http://hdl.handle.net/10150/185833.
Повний текст джерелаLarsson, Patrik. "Analyzing and adapting graph algorithms for large persistent graphs." Thesis, Linköping University, Department of Computer and Information Science, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-15422.
Повний текст джерелаIn this work, the graph database Neo4j developed by Neo Technology is presented together with some of it's functionality when it comes to accessing data as a graph. This type of data access brings the possibility to implement common graph algorithms on top of Neo4j. Examples of such algorithms are presented together with their theoretical backgrounds. These are mainly algorithms for finding shortest paths and algorithms for different graph measures such as centrality measures. The implementations that have been made are presented, as well as complexity analysis and the performance measures performed on them. The conclusions include that Neo4j is well suited for these types of implementations.
Zhang, Shijie. "Index-based Graph Querying and Matching in Large Graphs." Cleveland, Ohio : Case Western Reserve University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=case1263256028.
Повний текст джерелаTitle from PDF (viewed on 2010-04-12) Department of Electrical Engineering and Computer Science (EECS) Includes abstract Includes bibliographical references and appendices Available online via the OhioLINK ETD Center
McConville, Ryan. "Clustering algorithms for large scale graph data." Thesis, Queen's University Belfast, 2017. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.727648.
Повний текст джерелаYekollu, Srikar. "Graph Based Regularization of Large Covariance Matrices." The Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=osu1237243768.
Повний текст джерелаBetkaoui, Brahim. "Reconfigurable computing for large-scale graph traversal algorithms." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/25049.
Повний текст джерелаLarsson, Carl-Johan. "Movie Recommendation System Using Large Scale Graph-Processing." Thesis, KTH, Skolan för elektro- och systemteknik (EES), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-200601.
Повний текст джерелаSwartz, Eric Allen. "2-arc transitive polygonal graphs of large girth and valency." The Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=osu1243923530.
Повний текст джерелаTsalouchidou, Ioanna. "Temporal analysis of large dynamic graphs." Doctoral thesis, Universitat Pompeu Fabra, 2018. http://hdl.handle.net/10803/663755.
Повний текст джерелаL’objectiu d’aquesta tesi és proporcionar una anàlisi temporal de l'evolució estructural i d’interacció de grans gràfics dinàmics. En aquesta tesi proposem noves definicions de mètriques de gràfiques importants per tal d’incloure la dimensió temporal dels gràfics dinàmics. Ampliem tres problemes importants de mineria de dades en gràfics per a un entorn temporal. Els tres problemes són el resum de gràfics temporals, la cerca temporal de comunitats i la centralitat temporal dels gràfics. A més, proposem una versió distribuïda de tots els nostres algoritmes, que ajuden a les nostres tècniques a escalar fins a milions de vèrtexs. Finalment, avaluem la validesa dels nostres mètodes en termes d’eficiència i eficàcia amb una àmplia experimentació en gràfics del món real a gran escala.
El objetivo de esta tesis es proporcionar un análisis temporal de las dinámicas estructurales y de interacción de grafos masivos dinámicos. Para esto proponemos nuevas definiciones de métricas en grafos importantes para incluir la dimensión temporal de los grafos dinámicos. Además, ampliamos tres problemas importantes de minería de datos en un contexto temporal. Ellos son los resúmenes de grafos temporales, la búsqueda de comunidades en un contexto temporal y la centralidad temporal en grafos. Además, proponemos una versión distribuida de todos nuestros algoritmos, que permiten que nuestras técnicas a escalar hasta millones de vértices. Finalmente, evaluamos la validez de nuestros métodos en términos de eficiencia y efectividad con extensos experimentos en gráfos de gran escala en el mundo real.
Yuan, Wenjun, and 袁文俊. "Flexgraph: flexible subgraph search in large graphs." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B46087539.
Повний текст джерелаКниги з теми "Large graph"
Large networks and graph limits. Providence, Rhode Island: American Mathematical Society, 2012.
Знайти повний текст джерелаO'Connell, Neil. Some large deviation results for sparse random graphs. Bristol [England]: Hewlett Packard, 1996.
Знайти повний текст джерелаSakr, Sherif, Faisal Moeen Orakzai, Ibrahim Abdelaziz, and Zuhair Khayyat. Large-Scale Graph Processing Using Apache Giraph. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-47431-1.
Повний текст джерелаShao, Yingxia, Bin Cui, and Lei Chen. Large-scale Graph Analysis: System, Algorithm and Optimization. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-3928-2.
Повний текст джерелаManning, James. Large Graph Pad. The Sketchbook, Sketch Pad, Art Book, Drawing Pape, 2018.
Знайти повний текст джерелаZasimowicz. Hexagonal Graph Paper: Large. Independently Published, 2020.
Знайти повний текст джерелаZASIMOWICZ. Hexagonal Graph Paper: Large. Independently Published, 2020.
Знайти повний текст джерелаZASIMOWICZ. Hexagonal Graph Paper: Large. Independently Published, 2020.
Знайти повний текст джерелаZASIMOWICZ. Hexagonal Graph Paper: Large. Independently Published, 2020.
Знайти повний текст джерелаZASIMOWICZ. Hexagonal Graph Paper: Large. Independently Published, 2020.
Знайти повний текст джерелаЧастини книг з теми "Large graph"
Erciyes, K. "Large Graph Analysis." In Undergraduate Topics in Computer Science, 171–98. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-87886-3_10.
Повний текст джерелаGeyer, Markus, Michael Kaufmann, and Robert Krug. "Visualizing Differences between Two Large Graphs." In Graph Drawing, 393–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18469-7_38.
Повний текст джерелаNguyen, Quan, Peter Eades, Seok-Hee Hong, and Weidong Huang. "Large Crossing Angles in Circular Layouts." In Graph Drawing, 397–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18469-7_40.
Повний текст джерелаDwyer, Tim, and Lev Nachmanson. "Fast Edge-Routing for Large Graphs." In Graph Drawing, 147–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11805-0_15.
Повний текст джерелаBatagelj, Vladimir, and Andrej Mrvar. "Pajek— Analysis and Visualization of Large Networks." In Graph Drawing, 477–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45848-4_54.
Повний текст джерелаWills, Graham J. "NicheWorks — Interactive visualization of very large graphs." In Graph Drawing, 403–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63938-1_85.
Повний текст джерелаTee Teoh, Soon, and Ma Kwan-Liu. "RINGS: A Technique for Visualizing Large Hierarchies." In Graph Drawing, 268–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36151-0_25.
Повний текст джерелаKornaropoulos, Evgenios M., and Ioannis G. Tollis. "DAGView: An Approach for Visualizing Large Graphs." In Graph Drawing, 499–510. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36763-2_44.
Повний текст джерелаDumitrescu, Adrian, János Pach, and Géza Tóth. "Drawing Hamiltonian Cycles with No Large Angles." In Graph Drawing, 3–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11805-0_3.
Повний текст джерелаBatagelj, Vladimir, Andrej Mrvar, and Matjaž Zaveršnik. "Partitioning Approach to Visualization of Large Graphs." In Graph Drawing, 90–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46648-7_9.
Повний текст джерелаТези доповідей конференцій з теми "Large graph"
Stanton, Isabelle, and Gabriel Kliot. "Streaming graph partitioning for large distributed graphs." In the 18th ACM SIGKDD international conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2339530.2339722.
Повний текст джерелаMathys, Yves. "A graph browser for large directed graphs." In the 1992 ACM/SIGAPP Symposium. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/143559.143678.
Повний текст джерелаYao, Kai-Lang, and Wu-Jun Li. "Blocking-based Neighbor Sampling for Large-scale Graph Neural Networks." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/455.
Повний текст джерелаFaloutsos, Christos. "Large graph mining." In the 23rd international conference. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2566486.2576889.
Повний текст джерелаDong, Minjing, Hanting Chen, Yunhe Wang, and Chang Xu. "Crafting Efficient Neural Graph of Large Entropy." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/311.
Повний текст джерелаZhang, Lizhi, Zhiquan Lai, Feng Liu, and Zhejiang Ran. "ADGraph: Accurate, Distributed Training on Large Graphs." In 8th International Conference on Computer Science and Information Technology (CoSIT 2021). AIRCC Publishing Corporation, 2021. http://dx.doi.org/10.5121/csit.2021.110408.
Повний текст джерелаJiefeng Cheng, Xianggang Zeng, and J. X. Yu. "Top-k graph pattern matching over large graphs." In 2013 29th IEEE International Conference on Data Engineering (ICDE 2013). IEEE, 2013. http://dx.doi.org/10.1109/icde.2013.6544895.
Повний текст джерелаFilippidou, Ioanna, and Yannis Kotidis. "Effective and efficient graph augmentation in large graphs." In 2016 IEEE International Conference on Big Data (Big Data). IEEE, 2016. http://dx.doi.org/10.1109/bigdata.2016.7840681.
Повний текст джерелаChen, Zhihuai, Qian Li, Xiaoming Sun, Lirong Xia, and Jialin Zhang. "Approximate Single-Peakedness in Large Elections." In 2020 IEEE International Conference on Knowledge Graph (ICKG). IEEE, 2020. http://dx.doi.org/10.1109/icbk50248.2020.00068.
Повний текст джерелаTsapanos, Nikolaos, Anastasios Tefas, Nikolaos Nikolaidis, and Ioannis Pitas. "Large graph clustering using DCT-based graph clustering." In 2014 IEEE Symposium on Computational Intelligence in Big Data (CIBD). IEEE, 2014. http://dx.doi.org/10.1109/cibd.2014.7011536.
Повний текст джерелаЗвіти організацій з теми "Large graph"
Kuramochi, Michihiro, and George Karypis. Finding Frequent Patterns in a Large Sparse Graph. Fort Belvoir, VA: Defense Technical Information Center, September 2003. http://dx.doi.org/10.21236/ada438928.
Повний текст джерелаKyrola, Aapo. Large-scale Graph Computation on Just a PC. Fort Belvoir, VA: Defense Technical Information Center, May 2014. http://dx.doi.org/10.21236/ada603410.
Повний текст джерелаQi, Fei, Zhaohui Xia, Gaoyang Tang, Hang Yang, Yu Song, Guangrui Qian, Xiong An, Chunhuan Lin, and Guangming Shi. A Graph-based Evolutionary Algorithm for Automated Machine Learning. Web of Open Science, December 2020. http://dx.doi.org/10.37686/ser.v1i2.77.
Повний текст джерелаChau, Duen H. Data Mining Meets HCI: Making Sense of Large Graphs. Fort Belvoir, VA: Defense Technical Information Center, July 2012. http://dx.doi.org/10.21236/ada566568.
Повний текст джерелаBarooah, Prabir, and Joao P. Hespanha. Estimation from Relative Measurements: Electrical Analogy and Large Graphs. Fort Belvoir, VA: Defense Technical Information Center, September 2007. http://dx.doi.org/10.21236/ada473862.
Повний текст джерелаAkoglu, Leman, Jilles Vreeken, Hanghang Tong, Duen H. Chau, and Christos Faloutsos. Islands and Bridges: Making Sense of Marked Nodes in Large Graphs. Fort Belvoir, VA: Defense Technical Information Center, August 2012. http://dx.doi.org/10.21236/ada566565.
Повний текст джерелаAkoglu, Leman, Hanghang Tong, Nikolaj Tatti, Jilles Vreeken, Duen H. Chau, and Christos Faloutsos. Islands and Bridges: Making Sense of Marked Nodes in Large Graphs. Fort Belvoir, VA: Defense Technical Information Center, January 2013. http://dx.doi.org/10.21236/ada580208.
Повний текст джерелаToroczkai, Zoltan. DARPA Ensemble-Based Modeling Large Graphs & Applications to Social Networks. Fort Belvoir, VA: Defense Technical Information Center, July 2015. http://dx.doi.org/10.21236/ada627064.
Повний текст джерелаDe Sterck, H. FINAL REPORT (MILESTONE DATE 9/30/13) FOR SUBCONTRACT NO. B603393: "CLUSTERING AND RANDOMIZATION FOR LARGE GRAPHS AND HYPERGRAPHS". Office of Scientific and Technical Information (OSTI), September 2013. http://dx.doi.org/10.2172/1093898.
Повний текст джерелаOr, Etti, David Galbraith, and Anne Fennell. Exploring mechanisms involved in grape bud dormancy: Large-scale analysis of expression reprogramming following controlled dormancy induction and dormancy release. United States Department of Agriculture, December 2002. http://dx.doi.org/10.32747/2002.7587232.bard.
Повний текст джерела