Добірка наукової літератури з теми "Overlapping graphs"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Overlapping graphs".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Overlapping graphs"
HARALAMBIDES, JAMES, and SPYROS TRAGOUDAS. "BIPARTITIONING INTO OVERLAPPING SETS." International Journal of Foundations of Computer Science 06, no. 01 (March 1995): 67–88. http://dx.doi.org/10.1142/s0129054195000068.
Повний текст джерелаBhagavathi, D., H. Gurla, S. Olariu, J. L. Schwing, and J. Zhang. "Time- and Cost-Optimal Parallel Algorithms for the Dominance and Visibility Graphs." VLSI Design 4, no. 1 (January 1, 1996): 33–40. http://dx.doi.org/10.1155/1996/40175.
Повний текст джерелаEvans, T. S. "Clique graphs and overlapping communities." Journal of Statistical Mechanics: Theory and Experiment 2010, no. 12 (December 23, 2010): P12037. http://dx.doi.org/10.1088/1742-5468/2010/12/p12037.
Повний текст джерелаGalbrun, Esther, Aristides Gionis, and Nikolaj Tatti. "Overlapping community detection in labeled graphs." Data Mining and Knowledge Discovery 28, no. 5-6 (August 2, 2014): 1586–610. http://dx.doi.org/10.1007/s10618-014-0373-y.
Повний текст джерелаCRAMPES, MICHEL, and MICHEL PLANTIÉ. "A UNIFIED COMMUNITY DETECTION, VISUALIZATION AND ANALYSIS METHOD." Advances in Complex Systems 17, no. 01 (February 2014): 1450001. http://dx.doi.org/10.1142/s0219525914500015.
Повний текст джерелаMiro, Eden Delight, Aliw-iw Zambrano, and Agnes Garciano. "Construction of weavings in the plane." Acta Crystallographica Section A Foundations and Advances 74, no. 1 (January 1, 2018): 25–35. http://dx.doi.org/10.1107/s205327331701422x.
Повний текст джерелаWang, Guishen, Yuanwei Wang, Kaitai Wang, Zhihua Liu, Lijuan Zhang, Yu Zhou, and Qinan Yao. "An overlapping community detection algorithm based on node distance of line graph." Modern Physics Letters B 33, no. 26 (September 20, 2019): 1950322. http://dx.doi.org/10.1142/s0217984919503226.
Повний текст джерелаYoshida, Tetsuya. "Weighted line graphs for overlapping community discovery." Social Network Analysis and Mining 3, no. 4 (March 21, 2013): 1001–13. http://dx.doi.org/10.1007/s13278-013-0104-1.
Повний текст джерелаZhang, Zhenkun, and Hongjian Lai. "On Critical Unicyclic Graphs with Cutwidth Four." AppliedMath 2, no. 4 (November 17, 2022): 621–37. http://dx.doi.org/10.3390/appliedmath2040036.
Повний текст джерелаSingh, Sakshi. "Algorithm and Techniques for Overlapping Community Detection." International Journal of Advance Research and Innovation 2, no. 2 (2014): 52–60. http://dx.doi.org/10.51976/ijari.221408.
Повний текст джерелаДисертації з теми "Overlapping graphs"
Sardana, Divya. "Analysis of Meso-scale Structures in Weighted Graphs." University of Cincinnati / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1510927111275038.
Повний текст джерелаAttal, Jean-Philippe. "Nouveaux algorithmes pour la détection de communautés disjointes et chevauchantes basés sur la propagation de labels et adaptés aux grands graphes." Thesis, Cergy-Pontoise, 2017. http://www.theses.fr/2017CERG0842/document.
Повний текст джерелаGraphs are mathematical structures amounting to a set of nodes (objects or persons) in which some pairs are in linked with edges. Graphs can be used to model complex systems.One of the main problems in graph theory is the community detection problemwhich aims to find a partition of nodes in the graph to understand its structure.For instance, by representing insurance contracts by nodes and their relationship by edges,detecting groups of nodes highly connected leads to detect similar profiles and to evaluate risk profiles. Several algorithms are used as aresponse to this currently open research field.One of the fastest method is the label propagation.It's a local method, in which each node changes its own label according toits neighbourhood.Unfortunately, this method has two major drawbacks. The first is the instability of the method. Each trialgives rarely the same result.The second is a bad propagation which can lead to huge communities without sense (giant communities problem).The first contribution of the thesis is i) proposing a stabilisation methodfor the label propagation with artificial dams on edges of some networks in order to limit bad label propagations. Complex networks are also characterized by some nodes which may belong to several communities,we call this a cover.For example, in Protein–protein interaction networks, some proteins may have several functions.Detecting these functions according to their communities could help to cure cancers. The second contribution of this thesis deals with the ii)implementation of an algorithmwith functions to detect potential overlapping nodes .The size of the graphs is also to be considered because some networks contain several millions of nodes and edges like the Amazon product co-purchasing network.We propose iii) a parallel and a distributed version of the community detection using core label propagation.A study and a comparative analysis of the proposed algorithms will be done based on the quality of the resulted partitions and covers
Das, Nivedita. "Modeling three-dimensional shape of sand grains using Discrete Element Method." [Tampa, Fla.] : University of South Florida, 2007. http://purl.fcla.edu/usf/dc/et/SFE0002072.
Повний текст джерелаAzevedo, Vinicius da Costa. "Efficient smoke simulation on curvilinear grids." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2012. http://hdl.handle.net/10183/78361.
Повний текст джерелаSun, Xufei. "Efficient Community Detection." Thesis, 2015. http://hdl.handle.net/1885/16471.
Повний текст джерелаMalema, Gabofetswe Alafang. "Low-density parity-check codes : construction and implementation." 2007. http://hdl.handle.net/2440/45525.
Повний текст джерелаThesis(Ph.D.) -- University of Adelaide, School of Electrical and Electronic Engineering, 2007
Malema, Gabofetswe Alafang. "Low-density parity-check codes : construction and implementation." Thesis, 2007. http://hdl.handle.net/2440/45525.
Повний текст джерелаThesis(Ph.D.) -- University of Adelaide, School of Electrical and Electronic Engineering, 2007
Rezvani, Mojtaba. "Community Structure in Large-Scale Complex Networks." Phd thesis, 2019. http://hdl.handle.net/1885/187032.
Повний текст джерелаКниги з теми "Overlapping graphs"
Waldmann, Carl, Neil Soni, and Andrew Rhodes. Neurological disorders. Oxford University Press, 2011. http://dx.doi.org/10.1093/med/9780199229581.003.0022.
Повний текст джерелаLézine, Anne-Marie. Vegetation at the Time of the African Humid Period. Oxford University Press, 2017. http://dx.doi.org/10.1093/acrefore/9780190228620.013.530.
Повний текст джерелаЧастини книг з теми "Overlapping graphs"
Marik, Radek, and Tomas Zikmund. "Overlapping Communities in Bipartite Graphs." In Studies in Computational Intelligence, 207–18. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-05411-3_17.
Повний текст джерелаSlavnov, Konstantin, and Maxim Panov. "Overlapping Community Detection in Weighted Graphs: Matrix Factorization Approach." In Communications in Computer and Information Science, 3–14. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-35400-8_1.
Повний текст джерелаYoshida, Tetsuya. "Overlapping Community Discovery via Weighted Line Graphs of Networks." In Lecture Notes in Computer Science, 895–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32695-0_94.
Повний текст джерелаYoshida, Tetsuya. "Weighted Line Graphs for Overlapping Community Discovery and their Evaluation." In Communications in Computer and Information Science, 121–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40140-4_13.
Повний текст джерелаBijlsma, Tjerk, Marco J. G. Bekooij, and Gerard J. M. Smit. "Circular Buffers with Multiple Overlapping Windows for Cyclic Task Graphs." In Transactions on High-Performance Embedded Architectures and Compilers V, 39–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2019. http://dx.doi.org/10.1007/978-3-662-58834-5_3.
Повний текст джерелаChykhradze, Kyrylo, Anton Korshunov, Nazar Buzun, Roman Pastukhov, Nikolay Kuzyurin, Denis Turdakov, and Hangkyu Kim. "Distributed Generation of Billion-node Social Graphs with Overlapping Community Structure." In Complex Networks V, 199–208. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-05401-8_19.
Повний текст джерелаMallot, Hanspeter A., Gerrit A. Ecke, and Tristan Baumann. "Dual Population Coding for Path Planning in Graphs with Overlapping Place Representations." In Lecture Notes in Computer Science, 3–17. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-57983-8_1.
Повний текст джерелаGabardo, Ademir, Regina Berretta, and Pablo Moscato. "Overlapping Communities in Co-purchasing and Social Interaction Graphs: A Memetic Approach." In Business and Consumer Analytics: New Ideas, 435–66. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-06222-4_9.
Повний текст джерелаPalazuelos, Camilo, and Marta Zorrilla. "FRINGE: A New Approach to the Detection of Overlapping Communities in Graphs." In Computational Science and Its Applications - ICCSA 2011, 638–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21931-3_49.
Повний текст джерелаAngelelli, Jean-Baptiste, Alain Guénoche, and Laurence Reboul. "Detection of Disjoint or Overlapping Communities in Networks." In Graph Partitioning, 297–314. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118601181.ch12.
Повний текст джерелаТези доповідей конференцій з теми "Overlapping graphs"
Held, Pascal, and Rudolf Kruse. "Detecting overlapping community hierarchies in dynamic graphs." In 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE, 2016. http://dx.doi.org/10.1109/asonam.2016.7752373.
Повний текст джерелаJian, Xun, Xiang Lian, and Lei Chen. "On Efficiently Detecting Overlapping Communities over Distributed Dynamic Graphs." In 2018 IEEE 34th International Conference on Data Engineering (ICDE). IEEE, 2018. http://dx.doi.org/10.1109/icde.2018.00142.
Повний текст джерелаKumar, Pushpa, Kang Zhang, and Yuke Wang. "Visualization of Clustered Directed Acyclic Graphs without Node Overlapping." In 2008 12th International Conference Information Visualisation (IV). IEEE, 2008. http://dx.doi.org/10.1109/iv.2008.85.
Повний текст джерелаSrimathy, S., and Andrew Thangaraj. "Codes that have tanner graphs with non-overlapping cycles." In 2008 5th International Symposium on Turbo Codes and Related Topics. IEEE, 2008. http://dx.doi.org/10.1109/turbocoding.2008.4658715.
Повний текст джерелаXinhua, E., Song Junde, Xu Ke, and Tong Junjie. "Overlapping Community Detection in Directed Graphs with Considering Local Fitness." In 5th IET International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN 2013). Institution of Engineering and Technology, 2013. http://dx.doi.org/10.1049/cp.2013.2421.
Повний текст джерелаQin, Zunying, Liyuan Huang, Bo She, Qiang Wang, Jingru Cui, and Guodong Li. "Detecting Overlapping Communities in Knowledge Graphs: A Density Optimization Based Approach." In 2018 IEEE International Conference on Big Knowledge (ICBK). IEEE, 2018. http://dx.doi.org/10.1109/icbk.2018.00010.
Повний текст джерелаTautenhain, Camila, and Mariá Nascimento. "Spectral Algorithm for Line Graphs to Find Overlapping Communities in Social Networks." In 11th International Conference on Agents and Artificial Intelligence. SCITEPRESS - Science and Technology Publications, 2019. http://dx.doi.org/10.5220/0007403803060317.
Повний текст джерелаArora, Gundeep, Anupreet Porwal, Kanupriya Agarwal, Avani Samdariya, and Piyush Rai. "Small-Variance Asymptotics for Nonparametric Bayesian Overlapping Stochastic Blockmodels." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/276.
Повний текст джерелаBijlsma, Tjerk, Marco J. G. Bekooij, and Gerard J. M. Smit. "Inter-task communication via overlapping read and write windows for deadlock-free execution of cyclic task graphs." In 2009 International Symposium on Systems, Architectures, Modeling, and Simulation (SAMOS). IEEE, 2009. http://dx.doi.org/10.1109/icsamos.2009.5289225.
Повний текст джерелаVickers, Paul, and Robert Höldrich. "Direct Segmented Sonification of Characteristic Features of the Data Domain." In ICAD 2019: The 25th International Conference on Auditory Display. Newcastle upon Tyne, United Kingdom: Department of Computer and Information Sciences, Northumbria University, 2019. http://dx.doi.org/10.21785/icad2019.043.
Повний текст джерелаЗвіти організацій з теми "Overlapping graphs"
Kellett, D. A., and A. Zagorevski. Overlap assemblages: Laberge Group of the Whitehorse Trough, northern Canadian Cordillera. Natural Resources Canada/CMSS/Information Management, 2021. http://dx.doi.org/10.4095/326064.
Повний текст джерелаWeiss, David, and Neil Olszewski. Manipulation of GA Levels and GA Signal Transduction in Anthers to Generate Male Sterility. United States Department of Agriculture, 2000. http://dx.doi.org/10.32747/2000.7580678.bard.
Повний текст джерела