Gotowa bibliografia na temat „Graphe simple”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Graphe simple”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Graphe simple"
Hudry, Olivier. "Application of the “descent with mutations” metaheuristic to a clique partitioning problem". RAIRO - Operations Research 53, nr 3 (lipiec 2019): 1083–95. http://dx.doi.org/10.1051/ro/2018048.
Pełny tekst źródłaMalik, M. Aslam, i M. Khalid Mahmood. "On Simple Graphs Arising from Exponential Congruences". Journal of Applied Mathematics 2012 (2012): 1–10. http://dx.doi.org/10.1155/2012/292895.
Pełny tekst źródłaVoorhees, Burton, i Alex Murray. "Fixation probabilities for simple digraphs". Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 469, nr 2154 (8.06.2013): 20120676. http://dx.doi.org/10.1098/rspa.2012.0676.
Pełny tekst źródłaAzari, M., i A. Iranmanesh. "On the edge-Wiener index of the disjunctive product of simple graphs". Algebra and Discrete Mathematics 30, nr 1 (2020): 1–14. http://dx.doi.org/10.12958/adm242.
Pełny tekst źródłaAli, Akbar. "Tetracyclic graphs with maximum second Zagreb index: A simple approach". Asian-European Journal of Mathematics 11, nr 05 (październik 2018): 1850064. http://dx.doi.org/10.1142/s179355711850064x.
Pełny tekst źródłaVasanthi, R., i K. Subramanian. "On Vertex Covering Transversal Domination Number of Regular Graphs". Scientific World Journal 2016 (2016): 1–7. http://dx.doi.org/10.1155/2016/1029024.
Pełny tekst źródłaVoorhees, Burton, i Bergerud Ryder. "Simple graph models of information spread in finite populations". Royal Society Open Science 2, nr 5 (maj 2015): 150028. http://dx.doi.org/10.1098/rsos.150028.
Pełny tekst źródłaTROTTA, BELINDA. "RESIDUAL PROPERTIES OF SIMPLE GRAPHS". Bulletin of the Australian Mathematical Society 82, nr 3 (18.08.2010): 488–504. http://dx.doi.org/10.1017/s0004972710000420.
Pełny tekst źródłaDevriendt, Karel, i Piet Van Mieghem. "The simplex geometry of graphs". Journal of Complex Networks 7, nr 4 (29.01.2019): 469–90. http://dx.doi.org/10.1093/comnet/cny036.
Pełny tekst źródłaBAHR, PATRICK. "Convergence in infinitary term graph rewriting systems is simple". Mathematical Structures in Computer Science 28, nr 8 (9.08.2018): 1363–414. http://dx.doi.org/10.1017/s0960129518000166.
Pełny tekst źródłaRozprawy doktorskie na temat "Graphe simple"
Islam, Md Kamrul. "Explainable link prediction in large complex graphs - application to drug repurposing". Electronic Thesis or Diss., Université de Lorraine, 2022. http://www.theses.fr/2022LORR0203.
Pełny tekst źródłaMany real-world complex systems can be well-represented with graphs, where nodes represent objects or entities and links/relations represent interactions between pairs of nodes. Link prediction (LP) is one of the most interesting and long-standing problems in the field of graph mining; it predicts the probability of a link between two unconnected nodes based on available information in the current graph. This thesis studies the LP problem in graphs. It consists of two parts: LP in simple graphs and LP knowledge graphs (KGs). In the first part, the LP problem is defined as predicting the probability of a link between a pair of nodes in a simple graph. In the first study, a few similarity-based and embedding-based LP approaches are evaluated and compared on simple graphs from various domains. he study also criticizes the traditional way of computing the precision metric of similarity-based approaches as the computation faces the difficulty of tuning the threshold for deciding the link existence based on the similarity score. We proposed a new way of computing the precision metric. The results showed the expected superiority of embedding-based approaches. Still, each of the similarity-based approaches is competitive on graphs with specific properties. We could check experimentally that similarity-based approaches are fully explainable but lack generalization due to their heuristic nature, whereas embedding-based approaches are general but not explainable. The second study tries to alleviate the unexplainability limitation of embedding-based approaches by uncovering interesting connections between them and similarity-based approaches to get an idea of what is learned in embedding-based approaches. The third study demonstrates how the similarity-based approaches can be ensembled to design an explainable supervised LP approach. Interestingly, the study shows high LP performance for the supervised approach across various graphs, which is competitive with embedding-based approaches.The second part of the thesis focuses on LP in KGs. A KG is represented as a collection of RDF triples, (head,relation,tail) where the head and the tail are two entities which are connected by a specific relation. The LP problem in a KG is formulated as predicting missing head or tail entities in a triple. LP approaches based on the embeddings of entities and relations of a KG have become very popular in recent years, and generating negative triples is an important task in KG embedding methods. The first study in this part discusses a new method called SNS to generate high-quality negative triples during the training of embedding methods for learning embeddings of KGs. The results we produced show better LP performance when SNS is injected into an embedding approach than when injecting state-of-the-art negative triple sampling methods. The second study in the second part discusses a new neuro-symbolic method of mining rules and an abduction strategy to explain LP by an embedding-based approach utilizing the learned rules. The third study applies the explainable LP to a COVID-19 KG to develop a new drug repurposing approach for COVID-19. The approach learns ”ensemble embeddings” of entities and relations in a COVID-19 centric KG, in order to get a better latent representation of the graph elements. For the first time to our knowledge, molecular docking is then used to evaluate the predictions obtained from drug repurposing using KG embedding. Molecular evaluation and explanatory paths bring reliability to prediction results and constitute new complementary and reusable methods for assessing KG-based drug repurposing. The last study proposes a distributed architecture for learning KG embeddings in distributed and parallel settings. The results of the study that the computational time of embedding methods improves remarkably without affecting LP performance when they are trained in the proposed distributed settings than the traditional centralized settings
Lehbab, Imène. "Problèmes métriques dans les espaces de Grassmann". Electronic Thesis or Diss., Mulhouse, 2023. http://www.theses.fr/2023MULH6508.
Pełny tekst źródłaThis work contributes to the field of metric geometry of the complex projective plane CP2 and the real Grassmannian manifold of the planes in R6. More specifically, we study all p-tuples, p ≥ 3, of equiangular lines in C3 or equidistant points in CP2, and p-tuples of equi-isoclinic planes in R6. Knowing that 9 is the maximum number of equiangular lines that can be constructed in C3, we develop a method to obtain all p-tuples of equiangular lines for all p ϵ [3,9]. In particular, we construct in C3 five congruence classes of quadruples of equiangular lines, one of which depends on a real parameter ɣ, which we extend to an infinite family of sextuples of equiangular lines depending on the same real parameter ɣ. In addition, we give the angles for which our sextuples extend beyond and up to 9-tuples. We know that there exists a p-tuple, p ≥ 3, of equi-isoclinic planes generating Rr, r ≥ 4, with parameter c, 0< c <1, if and only if there exists a square symmetric matrix, called Seidel matrix, of p × p square blocks of order 2, whose diagonal blocks are all zero and the others are orthogonal matrices in O(2) and whose smallest eigenvalue is equal to - 1/c and has multiplicity 2p-r. In this thesis, we investigate the case r=6 and we also show that we can explicitly determine the spectrum of all Seidel matrices of order 2p, p ≥ 3 whose off-diagonal blocks are in {R0, S0} where R0 and S0 are respectively the zero-angle rotation and the zero-angle symmetry. We thus show an unexpected link between some p-tuples of equi-isoclinic planes in Rr and simple graphs of order p
Montanaro, William M. Jr. "Character Degree Graphs of Almost Simple Groups". Kent State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=kent1398345504.
Pełny tekst źródłaCRUCIANI, EMILIO. "Simple Randomized Distributed Algorithms for Graph Clustering". Doctoral thesis, Gran Sasso Science Institute, 2019. http://hdl.handle.net/20.500.12571/9951.
Pełny tekst źródłaYan, Chenyu. "APPROXIMATING DISTANCES IN COMPLICATED GRAPHS BY DISTANCES IN SIMPLE GRAPHS WITH APPLICATIONS". Kent State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=kent1184639623.
Pełny tekst źródłaKimmel, Jason. "Simple Games on Networks". Oberlin College Honors Theses / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1307994412.
Pełny tekst źródłaOkeke, Nnamdi, i University of Lethbridge Faculty of Arts and Science. "Character generators and graphs for simple lie algebras". Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2006, 2006. http://hdl.handle.net/10133/532.
Pełny tekst źródłavii, 92 leaves ; 29 cm.
Everett, Alistaire Duncan Fraser. "Commuting involution graphs of certain finite simple classical groups". Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/commuting-involution-graphs-of-certain-finite-simple-classical-groups(dd54ee3d-8c94-42cd-87e1-d34770756466).html.
Pełny tekst źródłaBosi, Gianluca <1991>. "Simple random walks on some partially directed planar graphs". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amsdottorato.unibo.it/8914/1/bosi_gianluca_tesi.pdf.
Pełny tekst źródłaMahfoudh, Mariem. "Adaptation d'ontologies avec les grammaires de graphes typés : évolution et fusion". Thesis, Mulhouse, 2015. http://www.theses.fr/2015MULH1519/document.
Pełny tekst źródłaOntologies are a formal and explicit knowledge representation. They represent a given domain by their concepts and axioms while creating a consensus between a user community. To satisfy the new requirements of the represented domain, ontologies have to be regularly updated and adapted to maintain their consistency. The adaptation may take different forms (evolution, alignment, merging, etc.), and represents several scientific challenges. One of the most important is to preserve the consistency of the ontology during the changes. To address this issue, we are interested in this thesis to study the ontology changes and we propose a formal framework that can evolve and merge ontologies without affecting their consistency.First we propose TGGOnto (Typed Graph Grammars for Ontologies), a new formalism for the representation of ontologies and their changes using typed graph grammars (TGG). A coupling between ontologies and TGG is defined in order to take advantage of the graph grammars concepts, such as the NAC (Negative Application Conditions), in preserving the adapted ontology consistency. Second, we propose EvOGG (Evolving Ontologies with Graph Grammars), an ontology evolution approach that is based on the TGGOnto formalism that avoids inconsistencies using an a priori approach. We focus on OWL ontologies and we address both : (1) ontology enrichment by studying their structural level and (2) ontology population by studying the changes affecting individuals and their assertions. EvOGG approach defines different types of ontology changes (elementary, composite and complex) and ensures their implementation by the algebraic approach of graph transformation, SPO (Single pushout).Third, we propose GROM (Graph Rewriting for Ontology Merging), an ontologies merging approach that avoids data redundancy and reduces conflict in the merged result. The proposed approach consists of three steps: (1) the similarity search between concepts based on syntactic, structural and semantic techniques; (2) the ontologies merging by the algebraic approach SPO; (3) the global ontology adaptation with graph rewriting rules.To validate our proposals, we have developed several open source tools based on AGG (Attributed Graph Grammar) tool. These tools were applied to a set of ontologies, mainly on those developed in the frame of the CCAlps (Creatives Companies in Alpine Space) European project, which funded this thesis work
Książki na temat "Graphe simple"
Simple gospel, simply grace. Eugene, Oregon: Harvest House Publishers, 2015.
Znajdź pełny tekst źródłaHaviar, Miroslav. Vertex labellings of simple graphs. Lemgo, Germany: Heldermann Verlag, 2015.
Znajdź pełny tekst źródłaPraeger, Cheryl E. Low rank representations and graphs for sporadic groups. Cambridge [England]: Cambridge University Press, 1997.
Znajdź pełny tekst źródłaPraeger, Cheryl E. Low rank representations and graphs for sporadic groups. New York: Cambridge University Press, 1996.
Znajdź pełny tekst źródłaZörnig, Peter. Degeneracy Graphs and Simplex Cycling. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-45702-9.
Pełny tekst źródłaZörnig, Peter. Degeneracy graphs and simplex cycling. Berlin: Springer-Verlag, 1991.
Znajdź pełny tekst źródłaBooth, Bob. Simple use of Cricket Graph for PC Windows. Sheffield: University of Sheffield, Academic Computing Services, 1992.
Znajdź pełny tekst źródłaill, Sandoval Rafa, red. The simple life. Edina, Minn: Spotlight, 2009.
Znajdź pełny tekst źródłaGalloway, Gregory. As simple as snow. New York: Berkley Books, 2006.
Znajdź pełny tekst źródłaSkrobol, Sebastian. Quiet little Melody: A simple fairytale. Warszawa: Prószyński Media, 2014.
Znajdź pełny tekst źródłaCzęści książek na temat "Graphe simple"
Aubert, J. P., J. F. Baget i M. Chein. "Simple Conceptual Graphs and Simple Concept Graphs". W Conceptual Structures: Inspiration and Application, 87–101. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11787181_7.
Pełny tekst źródłaAndersen, H. H., M. Højbjerre, D. Sørensen i P. S. Eriksen. "Simple Undirected Graphs". W Linear and Graphical Models, 85–98. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-4240-6_5.
Pełny tekst źródłaHougardy, Stefan, i Jens Vygen. "Simple Graph Algorithms". W Algorithmic Mathematics, 85–90. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-39558-6_7.
Pełny tekst źródłaBrandes, Ulrik, i Boris Köpf. "Fast and Simple Horizontal Coordinate Assignment". W Graph Drawing, 31–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45848-4_3.
Pełny tekst źródłaBarth, Wilhelm, Michael Jünger i Petra Mutzel. "Simple and Efficient Bilayer Cross Counting". W Graph Drawing, 130–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36151-0_13.
Pełny tekst źródłaDai, Qionghai, i Yue Gao. "Mathematical Foundations of Hypergraph". W Artificial Intelligence: Foundations, Theory, and Algorithms, 19–40. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-0185-2_2.
Pełny tekst źródłaDaescu, Ovidiu, i Jun Luo. "Computing Simple Paths on Points in Simple Polygons". W Computational Geometry and Graph Theory, 41–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89550-3_5.
Pełny tekst źródłaWaltham, David. "More about graphs". W Mathematics: A Simple Tool for Geologists, 87–106. Boston, MA: Springer US, 1994. http://dx.doi.org/10.1007/978-1-4899-4479-5_6.
Pełny tekst źródłaChiaselotti, Giampiero, Davide Ciucci, Tommaso Gentile i Federico Infusino. "Preclusivity and Simple Graphs". W Lecture Notes in Computer Science, 127–37. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25783-9_12.
Pełny tekst źródłaFairbairn, Jon. "A simple abstract machine to execute supercombinators". W Graph Reduction, 49–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-18420-1_49.
Pełny tekst źródłaStreszczenia konferencji na temat "Graphe simple"
Wu, Junran, Shangzhe Li, Jianhao Li, Yicheng Pan i Ke Xu. "A Simple yet Effective Method for Graph Classification". W Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/497.
Pełny tekst źródłaZatesko, Leandro M., Renato Carmo i André L. P. Guedes. "Novel Procedures for Graph Edge-colouring". W XXXII Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/ctd.2019.6331.
Pełny tekst źródłaBei, Xiaohui, Youming Qiao i Shengyu Zhang. "Networked Fairness in Cake Cutting". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/508.
Pełny tekst źródłaWang, Huijuan, Siming Dai, Weiyue Su, Hui Zhong, Zeyang Fang, Zhengjie Huang, Shikun Feng, Zeyu Chen, Yu Sun i Dianhai Yu. "Simple and Effective Relation-based Embedding Propagation for Knowledge Representation Learning". W Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/382.
Pełny tekst źródłaDing, Huafeng, Jing Zhao i Zhen Huang. "The Establishment of Novel Structure Representation Models for Several Kinds of Mechanisms". W ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-86074.
Pełny tekst źródłaLi, Pengyong, Jun Wang, Ziliang Li, Yixuan Qiao, Xianggen Liu, Fei Ma, Peng Gao, Sen Song i Guotong Xie. "Pairwise Half-graph Discrimination: A Simple Graph-level Self-supervised Strategy for Pre-training Graph Neural Networks". W 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/371.
Pełny tekst źródłaParmacli, Dmitrii, i Serghei Cara. "Evaluating the dynamics of grape production in UTA Gagauzia". W The 8th International Conference "Management Strategies and Policies in the Contemporary Economy". Academy of Economic Studies of Moldova, 2023. http://dx.doi.org/10.53486/icspm2023.10.
Pełny tekst źródłaCampos, Raphael R., Ricardo Ferreira, Julio C. Goldner Vendramini, Fábio Cerqueira i Marcelo Lobato Martins. "Simulation of Scale Free Gene Regulatory Networks based on Threshold Functions on GPU". W Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2011. http://dx.doi.org/10.5753/wscad.2011.17271.
Pełny tekst źródłaKlobas, Nina, i Matjaž Krnc. "Fast Recognition of Some Parametric Graph Families". W 7th Student Computer Science Research Conference. University of Maribor Press, 2021. http://dx.doi.org/10.18690/978-961-286-516-0.7.
Pełny tekst źródłaDing, Huafeng, Peng Huang, Zhen Huang i Andrés Kecskeméthy. "An Automatic Method for Sketching of Planar Simple and Multiple Joint Kinematic Chains". W ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-47216.
Pełny tekst źródłaRaporty organizacyjne na temat "Graphe simple"
Green, Alastair, Paolo Guagliardo i Leonid Libkin. Property graphs and paths in GQL: Mathematical definitions. Linked Data Benchmark Council, październik 2021. http://dx.doi.org/10.54285/ldbc.tzjp7279.
Pełny tekst źródłaPinzon, Mauricio, i Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 17 : September, 2008. Inter-American Development Bank, wrzesień 2008. http://dx.doi.org/10.18235/0008250.
Pełny tekst źródłaGalindo, Arturo, i Mauricio Pinzon. Revelation of Expectations in Latin America (REVELA): No. 23 : March, 2009. Inter-American Development Bank, marzec 2009. http://dx.doi.org/10.18235/0008255.
Pełny tekst źródłaSalazni, Mariana, Andrew Powell, Mauricio Pinzon i Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 16 : August, 2008. Inter-American Development Bank, sierpień 2008. http://dx.doi.org/10.18235/0008249.
Pełny tekst źródłaPinzon, Mauricio, i Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 21 : January, 2009. Inter-American Development Bank, styczeń 2009. http://dx.doi.org/10.18235/0008253.
Pełny tekst źródłaPinzon, Mauricio, i Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 20 : December, 2008. Inter-American Development Bank, grudzień 2008. http://dx.doi.org/10.18235/0008252.
Pełny tekst źródłaPinzon, Mauricio, i Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 18 : October, 2008. Inter-American Development Bank, październik 2008. http://dx.doi.org/10.18235/0008251.
Pełny tekst źródłaGalindo, Arturo, i Mauricio Pinzon. Revelation of Expectations in Latin America (REVELA): No. 22 : February, 2009. Inter-American Development Bank, luty 2009. http://dx.doi.org/10.18235/0008254.
Pełny tekst źródłaStriuk, Andrii, Olena Rybalchenko i Svitlana Bilashenko. Development and Using of a Virtual Laboratory to Study the Graph Algorithms for Bachelors of Software Engineering. [б. в.], listopad 2020. http://dx.doi.org/10.31812/123456789/4462.
Pełny tekst źródłaLichter, Amnon, Joseph L. Smilanick, Dennis A. Margosan i Susan Lurie. Ethanol for postharvest decay control of table grapes: application and mode of action. United States Department of Agriculture, lipiec 2005. http://dx.doi.org/10.32747/2005.7587217.bard.
Pełny tekst źródła