Статті в журналах з теми "Large graph"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Large graph".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
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.
Повний текст джерелаLINIAL, NATHAN, JIŘÍ MATOUŠEK, OR SHEFFET, and GÁBOR TARDOS. "Graph Colouring with No Large Monochromatic Components." Combinatorics, Probability and Computing 17, no. 4 (July 2008): 577–89. http://dx.doi.org/10.1017/s0963548308009140.
Повний текст джерелаEt. al., M. Sailaja,. "Ensemble Distributed Search-FSGM-CRD Compressed Cache Algorithm for Large Datasets." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 2 (April 11, 2021): 2854–58. http://dx.doi.org/10.17762/turcomat.v12i2.2317.
Повний текст джерелаYang, Jianye, Wu Yao, and Wenjie Zhang. "Keyword Search on Large Graphs: A Survey." Data Science and Engineering 6, no. 2 (March 31, 2021): 142–62. http://dx.doi.org/10.1007/s41019-021-00154-4.
Повний текст джерелаYUSTER, RAPHAEL. "Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing." Combinatorics, Probability and Computing 21, no. 6 (September 27, 2012): 952–62. http://dx.doi.org/10.1017/s0963548312000235.
Повний текст джерелаDuan, Yucong, Lixu Shao, and Gongzhu Hu. "Specifying Knowledge Graph with Data Graph, Information Graph, Knowledge Graph, and Wisdom Graph." International Journal of Software Innovation 6, no. 2 (April 2018): 10–25. http://dx.doi.org/10.4018/ijsi.2018040102.
Повний текст джерелаLeonard, Lorne, Alan M. MacEachren, and Kamesh Madduri. "Graph-based visual analysis for large-scale hydrological modeling." Information Visualization 16, no. 3 (August 9, 2016): 205–16. http://dx.doi.org/10.1177/1473871616661868.
Повний текст джерелаHora, Akihito. "Central Limit Theorems and Asymptotic Spectral Analysis on Large Graphs." Infinite Dimensional Analysis, Quantum Probability and Related Topics 01, no. 02 (April 1998): 221–46. http://dx.doi.org/10.1142/s0219025798000144.
Повний текст джерелаLin, Zhe, Fan Zhang, Xuemin Lin, Wenjie Zhang, and Zhihong Tian. "Hierarchical core maintenance on large dynamic graphs." Proceedings of the VLDB Endowment 14, no. 5 (January 2021): 757–70. http://dx.doi.org/10.14778/3446095.3446099.
Повний текст джерелаSu, Jing, Hongyu Wang, and Bing Yao. "On Elegant Labelling and Magic Labelling of Large-Scale Graphs." Discrete Dynamics in Nature and Society 2022 (March 28, 2022): 1–10. http://dx.doi.org/10.1155/2022/6301674.
Повний текст джерелаKrivelevich, Michael. "Ks-Free Graphs Without Large Kr-Free Subgraphs." Combinatorics, Probability and Computing 3, no. 3 (September 1994): 349–54. http://dx.doi.org/10.1017/s0963548300001243.
Повний текст джерелаWade, Andrew R. "Explicit laws of large numbers for random nearest-neighbour-type graphs." Advances in Applied Probability 39, no. 2 (June 2007): 326–42. http://dx.doi.org/10.1239/aap/1183667613.
Повний текст джерелаSerratosa, Francesc. "A Methodology to Generate Attributed Graphs with a Bounded Graph Edit Distance for Graph-Matching Testing." International Journal of Pattern Recognition and Artificial Intelligence 32, no. 11 (July 24, 2018): 1850038. http://dx.doi.org/10.1142/s0218001418500386.
Повний текст джерелаMathieu, Claire, and Michel de Rougemont. "Large very dense subgraphs in a stream of edges." Network Science 9, no. 4 (December 2021): 403–24. http://dx.doi.org/10.1017/nws.2021.17.
Повний текст джерелаRazi, Adeel, Mohamed L. Seghier, Yuan Zhou, Peter McColgan, Peter Zeidman, Hae-Jeong Park, Olaf Sporns, Geraint Rees, and Karl J. Friston. "Large-scale DCMs for resting-state fMRI." Network Neuroscience 1, no. 3 (October 2017): 222–41. http://dx.doi.org/10.1162/netn_a_00015.
Повний текст джерелаWade, Andrew R. "Explicit laws of large numbers for random nearest-neighbour-type graphs." Advances in Applied Probability 39, no. 02 (June 2007): 326–42. http://dx.doi.org/10.1017/s0001867800001786.
Повний текст джерелаRao, Bapuji, and Sarojananda Mishra. "A New Approach to Community Graph Partition Using Graph Mining Techniques." International Journal of Rough Sets and Data Analysis 4, no. 1 (January 2017): 75–94. http://dx.doi.org/10.4018/ijrsda.2017010105.
Повний текст джерелаLiu, Yang, Wei Wei, and Heyang Xu. "Engineering Bi-Connected Component Overlay for Maximum-Flow Parallel Acceleration in Large Sparse Graph." Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University 36, no. 5 (October 2018): 955–62. http://dx.doi.org/10.1051/jnwpu/20183650955.
Повний текст джерелаBennett, Patrick, Andrzej Dudek, and Shira Zerbib. "Large triangle packings and Tuza’s conjecture in sparse random graphs." Combinatorics, Probability and Computing 29, no. 5 (July 22, 2020): 757–79. http://dx.doi.org/10.1017/s0963548320000115.
Повний текст джерелаCoppini, Fabio, Helge Dietert, and Giambattista Giacomin. "A law of large numbers and large deviations for interacting diffusions on Erdős–Rényi graphs." Stochastics and Dynamics 20, no. 02 (July 10, 2019): 2050010. http://dx.doi.org/10.1142/s0219493720500100.
Повний текст джерелаTian, Yanjia, and Xiang Feng. "Large Margin Graph Embedding-Based Discriminant Dimensionality Reduction." Scientific Programming 2021 (December 3, 2021): 1–12. http://dx.doi.org/10.1155/2021/2934362.
Повний текст джерелаPacher, Dominic, Robert Binna, and Günther Specht. "Optimizing large knowledge networks in spatial computers." Knowledge Engineering Review 31, no. 4 (September 2016): 367–90. http://dx.doi.org/10.1017/s0269888916000187.
Повний текст джерелаCheng, Hong, and Jeffrey Xu Yu. "Clustering Large Attributed Graph." Journal of Information Processing 20, no. 4 (2012): 806–13. http://dx.doi.org/10.2197/ipsjjip.20.806.
Повний текст джерелаDuan, Shi-Jie, and Feng Li. "Exact Wiener Index of the Direct Product of a Path and a Wheel Graph." Mathematical Problems in Engineering 2022 (February 10, 2022): 1–6. http://dx.doi.org/10.1155/2022/1077549.
Повний текст джерелаXu, Jin, Yu Zhong, and Bo Peng. "Parallel k-Way Partitioning Approach for Large Graphs." Advanced Materials Research 912-914 (April 2014): 1309–12. http://dx.doi.org/10.4028/www.scientific.net/amr.912-914.1309.
Повний текст джерелаNikoghosyan, Zh G. "Graph Invariants and Large Cycles: A Survey." International Journal of Mathematics and Mathematical Sciences 2011 (2011): 1–11. http://dx.doi.org/10.1155/2011/206404.
Повний текст джерелаCordella, L. P., P. Foggia, C. Sansone, and M. Vento. "A (sub)graph isomorphism algorithm for matching large graphs." IEEE Transactions on Pattern Analysis and Machine Intelligence 26, no. 10 (October 2004): 1367–72. http://dx.doi.org/10.1109/tpami.2004.75.
Повний текст джерелаCai, Zhuang, Kang Zhang, and Dong-Ni Hu. "Visualizing large graphs by layering and bundling graph edges." Visual Computer 35, no. 5 (April 30, 2018): 739–51. http://dx.doi.org/10.1007/s00371-018-1509-7.
Повний текст джерелаAridhi, Sabeur, Alberto Montresor, and Yannis Velegrakis. "BLADYG: A Graph Processing Framework for Large Dynamic Graphs." Big Data Research 9 (September 2017): 9–17. http://dx.doi.org/10.1016/j.bdr.2017.05.003.
Повний текст джерелаZheng, Weiguo, Lei Zou, Xiang Lian, Dong Wang, and Dongyan Zhao. "Efficient Graph Similarity Search Over Large Graph Databases." IEEE Transactions on Knowledge and Data Engineering 27, no. 4 (April 1, 2015): 964–78. http://dx.doi.org/10.1109/tkde.2014.2349924.
Повний текст джерелаYuan, Ye, Guoren Wang, Lei Chen, and Haixun Wang. "Graph similarity search on large uncertain graph databases." VLDB Journal 24, no. 2 (December 9, 2014): 271–96. http://dx.doi.org/10.1007/s00778-014-0373-y.
Повний текст джерелаVengerovsky, V. "Eigenvalue Distribution of a Large Weighted Bipartite Random Graph." Zurnal matematiceskoj fiziki, analiza, geometrii 10, no. 2 (June 25, 2014): 240–55. http://dx.doi.org/10.15407/mag10.02.240.
Повний текст джерелаJarrar, Mustafa, and Anton Deik. "The Graph Signature." International Journal on Semantic Web and Information Systems 11, no. 2 (April 2015): 36–65. http://dx.doi.org/10.4018/ijswis.2015040102.
Повний текст джерелаZhou, Jiang, Lizhu Sun, Hongmei Yao, and Changjiang Bu. "On the nullity of connected graphs with least eigenvalue at least -2." Applicable Analysis and Discrete Mathematics 7, no. 2 (2013): 250–61. http://dx.doi.org/10.2298/aadm130710014z.
Повний текст джерелаHàn, Hiêp, Troy Retter, Vojtêch Rödl, and Mathias Schacht. "Ramsey-type numbers involving graphs and hypergraphs with large girth." Combinatorics, Probability and Computing 30, no. 5 (April 12, 2021): 722–40. http://dx.doi.org/10.1017/s0963548320000383.
Повний текст джерелаHuang, Xueqin, Xianqiang Zhu, Xiang Xu, Qianzhen Zhang, and Ailin Liang. "Parallel Learning of Dynamics in Complex Systems." Systems 10, no. 6 (December 15, 2022): 259. http://dx.doi.org/10.3390/systems10060259.
Повний текст джерелаSonobe, Tomohiro. "An Efficient Monte Carlo Approach to Compute PageRank for Large Graphs on a Single PC." Foundations of Computing and Decision Sciences 41, no. 1 (March 1, 2016): 29–43. http://dx.doi.org/10.1515/fcds-2016-0002.
Повний текст джерелаYang, Yajun, Zhongfei Li, Xin Wang, and Qinghua Hu. "Finding the Shortest Path with Vertex Constraint over Large Graphs." Complexity 2019 (February 19, 2019): 1–13. http://dx.doi.org/10.1155/2019/8728245.
Повний текст джерелаLeal, José. "Visualization of path patterns in semantic graphs." Computer Science and Information Systems 17, no. 1 (2020): 229–52. http://dx.doi.org/10.2298/csis180717038l.
Повний текст джерелаJOHANNSEN, DANIEL, MICHAEL KRIVELEVICH, and WOJCIECH SAMOTIJ. "Expanders Are Universal for the Class of All Spanning Trees." Combinatorics, Probability and Computing 22, no. 2 (January 3, 2013): 253–81. http://dx.doi.org/10.1017/s0963548312000533.
Повний текст джерелаMikheenko, Alla, and Mikhail Kolmogorov. "Assembly Graph Browser: interactive visualization of assembly graphs." Bioinformatics 35, no. 18 (February 4, 2019): 3476–78. http://dx.doi.org/10.1093/bioinformatics/btz072.
Повний текст джерела