Literatura científica selecionada sobre o tema "Graphe complet"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Graphe complet".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Graphe complet"
Potgieter, Zelda. "Lacan’s three orders, the graphe complet and music in film:". Communicare: Journal for Communication Studies in Africa 26, n.º 1 (20 de outubro de 2022): 1–26. http://dx.doi.org/10.36615/jcsa.v26i1.1708.
Texto completo da fonteCappelletti, Luca, Tommaso Fontana, Elena Casiraghi, Vida Ravanmehr, Tiffany J. Callahan, Carlos Cano, Marcin P. Joachimiak et al. "GRAPE for fast and scalable graph processing and random-walk-based embedding". Nature Computational Science 3, n.º 6 (26 de junho de 2023): 552–68. http://dx.doi.org/10.1038/s43588-023-00465-8.
Texto completo da fonteIsmayil, A. Mohamed, e N. Azhagendran. "Isomorphism on Complex Fuzzy Graph". Indian Journal Of Science And Technology 17, SPI1 (25 de abril de 2024): 86–92. http://dx.doi.org/10.17485/ijst/v17sp1.165.
Texto completo da fonteHanif, S., K. A. Bhat e G. Sudhakara. "Complete (2,2) Bipartite Graphs". Malaysian Journal of Mathematical Sciences 16, n.º 2 (29 de abril de 2022): 379–90. http://dx.doi.org/10.47836/mjms.16.2.13.
Texto completo da fonteChen, Yuzhong, Zhenyu Liu, Yulin Liu e Chen Dong. "Distributed Attack Modeling Approach Based on Process Mining and Graph Segmentation". Entropy 22, n.º 9 (14 de setembro de 2020): 1026. http://dx.doi.org/10.3390/e22091026.
Texto completo da fonteDEACONU, VALENTIN, ALEX KUMJIAN e JOHN QUIGG. "Group actions on topological graphs". Ergodic Theory and Dynamical Systems 32, n.º 5 (16 de setembro de 2011): 1527–66. http://dx.doi.org/10.1017/s014338571100040x.
Texto completo da fonteShukla, Samir, Shuchita Goyal e Anurag Singh. "Homotopy Type of Independence Complexes of Certain Families of Graphs". Contributions to Discrete Mathematics 16, n.º 3 (31 de dezembro de 2021): 74–92. http://dx.doi.org/10.55016/ojs/cdm.v16i3.71284.
Texto completo da fonteJi, Shengwei, Chenyang Bu, Lei Li e Xindong Wu. "Local Graph Edge Partitioning". ACM Transactions on Intelligent Systems and Technology 12, n.º 5 (31 de outubro de 2021): 1–25. http://dx.doi.org/10.1145/3466685.
Texto completo da fonteLu, Jing, Hafiz Mutee-ur-Rehman, Saima Nazeer e Xuemei An. "The Edge-Weighted Graph Entropy Using Redefined Zagreb Indices". Mathematical Problems in Engineering 2022 (28 de março de 2022): 1–12. http://dx.doi.org/10.1155/2022/5958913.
Texto completo da fonteR., Hemalatha, e K. Somasundaram. "SOMBOR INDEX OF EDGE CORONA PRODUCT OF SOME CLASSES OF GRAPHS". South East Asian J. of Mathematics and Mathematical Sciences 18, n.º 03 (30 de dezembro de 2022): 307–16. http://dx.doi.org/10.56827/seajmms.2022.1803.25.
Texto completo da fonteTeses / dissertações sobre o assunto "Graphe complet"
Cornet, Alexis. "Algorithmes et résultats de complexité pour des problèmes de graphes avec contraintes additionnelles". Thesis, Université Clermont Auvergne (2017-2020), 2018. http://www.theses.fr/2018CLFAC034/document.
Texto completo da fonteDomination problems (dominating set, independant dominating set, ...) as well as covering problems (vertex-cover, Steiner tree, ...) are NP-complete. However, for most of these problems, it is always possible to construct a (eventually bad) solution in polynomial time, or at least it is possible to determine whether a solution exists. Those problems originally came from industry, but are simplified modelizations of the real life problems. We add additional constraints modeling plausible practical constraints : conflicts which are pairs of elements that cannot apear simultaneously in a solution (to modelize various incompatibilities), connexity in a second graph (elements of the solution must be able to communicate, and the communication links are a second graph), and obligations which are subsets of interdependant vertices which must be added simultaneously in a solution.We don't aim to model a specific real-world problem, but to study how these plausible constraints affect the complexity of the studied problems. We will see that, in many cases, even determining the existence of a solution (regardless of its size) become hard. The firefighter problem models firefighters aiming to contain a fire spreading turn by turn in a (eventually infinite) graph. We studied this problem with the addition of deplacement constraints for the firefighters (a limited moving speed between turns). We will see that, most of the time, this constraint increase the number of firefighters necessary to contain the fire, but does not trigger such major change as constraints studied in the others problems
Ghaemi, Mohammadreza. "Etude de la complexité algorithmique associée à des opérations de décomposition de graphes". Paris 6, 2008. http://www.theses.fr/2008PA066449.
Texto completo da fonteSima, Xingyu. "La gestion des connaissances dans les petites et moyennes entreprises : un cadre adapté et complet". Electronic Thesis or Diss., Université de Toulouse (2023-....), 2024. http://www.theses.fr/2024TLSEP047.
Texto completo da fonteKnowledge is vital for organizations, particularly in today’s Industry 4.0 context. Knowledge Management (KM) plays a critical role in an organization's success. Although KM has been relatively well-studied in large organizations, Small and Medium-sized Enterprises (SMEs) receive less attention. SMEs face unique challenges in KM, requiring a tailored KM framework. Our study aims to define a framework addressing their challenges while leveraging their inherent strengths. This thesis presents a dedicated and comprehensive SME KM framework, offering dedicated solutions from knowledge acquisition and representation to exploitation: (1) a dedicated knowledge acquisition process based on the Scrum framework, an agile methodology, (2) a dedicated knowledge representation model based on semi-structured KG, and (3) a dedicated knowledge exploitation process based on knowledge-relatedness RS. This research was conducted in collaboration with Axsens-bte, an SME specializing in consultancy and training. The partnership with Axsens-bte has provided invaluable insights and practical experiences, contributing to developing the proposed KM framework and highlighting its relevance and applicability in real-world SME contexts
Culus, Jean-François. "Décompositions acircuituques de grands graphes orientés:des apsects algorithmiques aux aspects combinatoires". Phd thesis, Université Toulouse le Mirail - Toulouse II, 2006. http://tel.archives-ouvertes.fr/tel-00134814.
Texto completo da fonteOn étudie certaines propriétés algorithmiques et combinatoires pour successivement trois types de colorations : orientée, mixte et décomposition acircuitique.
Pour la coloration orientée, on obtient des résultats de NP-complétude pour des classes de graphes très spécifiques ainsi que des résultats d'inapproximabilité. Pour dépasser ces difficultés, nous définissons une notion de coloration mixte et obtenons un résultat d'approximation différentielle ainsi qu'une interprétation du polynôme chromatique mixte qui généralise le résultat de Stanley pour certains graphes mixtes. En relachant la contrainte de classe monochromatique stable, nous étudions finalement la complexité de la décomposition acircuitique, caractérisons une famille de tournoi critique indécomposable et établissons les premières propriétés du polynôme chromatique acircuitique.
Glorieux, Antoine. "Optimizing the imbalances in a graph". Thesis, Evry, Institut national des télécommunications, 2017. http://www.theses.fr/2017TELE0011/document.
Texto completo da fonteThe imbalance of a vertex in a directed graph is the absolute value of the difference between its outdegree and indegree. In this thesis we study the problem of orienting the edges of a graph in such a way that the image of the vector which components are the imbalances of the vertices of the graph under an objective function f is maximized. The first case considered is the problem of maximizing the minimum imbalance of all the vertices over all the possible orientations of the input graph. We first characterize graphs for which the optimal objective value is zero. Next we give several results concerning the computational complexity of the problem. Finally, we deal with several mixed integer programming formulations for this problem and present some numerical experiments. Next, we show that the case for f=1/2 | |·| |₁ leads to the famous unweighted maximum cut problem. We introduce some new formulations along with a new bound shown to be tighter than Michel Goemans & David Williamson's. Theoretical and computational results regarding bounds quality and performance are also reported. Finally, in order to strengthen some formulations of the studied problems, we study a specific class of polytopes. Consider the polytope consisting in the convex hull of the 0/1 assignment matrices where each column contains exactly one coefficient equal to 1 appended with their index of the lowest row that is not identically equal to the zero row. We give a full description of this polytope and some of its variants which naturally appear in the context of several combinatorial optimization problems. We also show that linear optimization over those polytopes can be done in polynomial time
Glorieux, Antoine. "Optimizing the imbalances in a graph". Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2017. http://www.theses.fr/2017TELE0011.
Texto completo da fonteThe imbalance of a vertex in a directed graph is the absolute value of the difference between its outdegree and indegree. In this thesis we study the problem of orienting the edges of a graph in such a way that the image of the vector which components are the imbalances of the vertices of the graph under an objective function f is maximized. The first case considered is the problem of maximizing the minimum imbalance of all the vertices over all the possible orientations of the input graph. We first characterize graphs for which the optimal objective value is zero. Next we give several results concerning the computational complexity of the problem. Finally, we deal with several mixed integer programming formulations for this problem and present some numerical experiments. Next, we show that the case for f=1/2 | |·| |₁ leads to the famous unweighted maximum cut problem. We introduce some new formulations along with a new bound shown to be tighter than Michel Goemans & David Williamson's. Theoretical and computational results regarding bounds quality and performance are also reported. Finally, in order to strengthen some formulations of the studied problems, we study a specific class of polytopes. Consider the polytope consisting in the convex hull of the 0/1 assignment matrices where each column contains exactly one coefficient equal to 1 appended with their index of the lowest row that is not identically equal to the zero row. We give a full description of this polytope and some of its variants which naturally appear in the context of several combinatorial optimization problems. We also show that linear optimization over those polytopes can be done in polynomial time
Halftermeyer, Pierre. "Connexité dans les Réseaux et Schémas d’Étiquetage Compact d’Urgence". Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0140/document.
Texto completo da fonteWe aim at assigning each vertex x of a n-vertices graph G a compact O(log n)-bit label L(x) in order to :1. construct, from the labels of the vertices of a forbidden set X C V (G), a datastructure S(X)2. decide, from S(X), L(u) and L(v), whether two vertices u and v are connected in G n X.We give a solution to this problem for the family of 3-connected graphs whith bounded genus.— We obtain O(g log n)-bit labels.— S(X) is computed in O(Sort([X]; n)) time.— Connection between vertices is decided in O(log log n) optimal time.We finally extend this result to H-minor-free graphs. This scheme requires O(polylog n)-bit labels
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.
Texto completo da fonteMany 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
Dieng, Youssou. "Décomposition arborescente des graphes planaires et routage compact". Thesis, Bordeaux 1, 2009. http://www.theses.fr/2009BOR13855/document.
Texto completo da fonteIn a network, it is crucial to know how to construct an efficent routing scheme. It is fundamental for each entity with its local knowledge of the network, to be able to decide on which link to forward messages. Thus, it is important to sutdy the underlying network topology in order to design routing schemes. In the first part of this thesis, we construct a new tree-decomposition for planar graphs. In fact, as in many graph problems, the study of the graph structure leads to do a tree-decomposition for exploiting structural propertys of the graphs. In second part, we studied the structure of H-minor free graphs, in particular whenever H = K_{2,r}. Our results improve upon previous known bounds about the tree-width of K_{2,r}-minor free graphs. At last, we treat the problème of compact routing scheme. More precisely, we are interested in shortest-path routing schemes that use O(\log n) bits for addresses, headers and routing tables, where n is the number of vertices in the graph. We propose such a routing scheme for a large family of weighted graphs including outerplanar graphs
Allagan, Julian Apelete D. Johnson Peter D. "Choice numbers, Ohba numbers and Hall numbers of some complete k-partite graphs". Auburn, Ala, 2009. http://hdl.handle.net/10415/1780.
Texto completo da fonteLivros sobre o assunto "Graphe complet"
Simmonds, William Francis. Complete parameterized presentations and almost convex Cayley graphs. [s.l.]: typescript, 1991.
Encontre o texto completo da fonteScheffler, Petra. Linear-time algorithms for NP-complete problems restricted to partial k-trees. Berlin: Akademie der Wissenschaften der DDR, Karl-Weierstrass-Institut für Mathematik, 1987.
Encontre o texto completo da fonteJohn, Wagner. The complete America. London: Titan, 2003.
Encontre o texto completo da fonteMichael, Lark, ed. The compleat Terminal city. Milwaukie, OR: Dark Horse Books, 2012.
Encontre o texto completo da fontePublishing, Spark, ed. Complete curriculum. New York: Spark Publishing, 2006.
Encontre o texto completo da fonteCoolen, Ton, Alessia Annibale e Ekaterina Roberts. Generating Random Networks and Graphs. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.001.0001.
Texto completo da fonteKalia, Rajat. Complete Course in Physics (Graphs). Independently Published, 2017.
Encontre o texto completo da fonteComplete Course in Physics ( Graphs ). Lulu Press, Inc., 2017.
Encontre o texto completo da fonteComplete Course in Physics ( Graphs ). Lulu Press, Inc., 2017.
Encontre o texto completo da fonteComplete Course in Physics ( Graphs ). Lulu Press, Inc., 2017.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Graphe complet"
Gebhardt, Friedrich, Angi Voß, Wolfgang Gräther e Barbara Schmidt-Belz. "Graphs". In Reasoning with Complex Cases, 75–82. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6233-7_7.
Texto completo da fonteDondi, Riccardo, Pietro Hiram Guzzi e Mohammad Mehdi Hosseinzadeh. "Integrating Temporal Graphs via Dual Networks: Dense Graph Discovery". In Complex Networks and Their Applications XI, 523–35. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-21131-7_41.
Texto completo da fonteIordache, Octavian. "Existential Graphs". In Understanding Complex Systems, 165–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17946-4_10.
Texto completo da fonteKamiński, Bogumił, Paweł Prałat e François Théberge. "Embedding Graphs". In Mining Complex Networks, 231–38. Boca Raton: Chapman and Hall/CRC, 2021. http://dx.doi.org/10.1201/9781003218869-9.
Texto completo da fonteKamiński, Bogumił, Paweł Prałat e François Théberge. "Graph Embeddings". In Mining Complex Networks, 161–200. Boca Raton: Chapman and Hall/CRC, 2021. http://dx.doi.org/10.1201/9781003218869-6.
Texto completo da fonteKamiński, Bogumił, Paweł Prałat e François Théberge. "Graph Theory". In Mining Complex Networks, 3–26. Boca Raton: Chapman and Hall/CRC, 2021. http://dx.doi.org/10.1201/9781003218869-1.
Texto completo da fonteBuchin, Kevin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira e Alexander Wolff. "Drawing (Complete) Binary Tanglegrams". In Graph Drawing, 324–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00219-9_32.
Texto completo da fonteKurasov, Pavel. "The Trace Formula". In Operator Theory: Advances and Applications, 179–208. Berlin, Heidelberg: Springer Berlin Heidelberg, 2023. http://dx.doi.org/10.1007/978-3-662-67872-5_8.
Texto completo da fonteHusák, Martin, Joseph Khoury, Đorđe Klisura e Elias Bou-Harb. "On the Provision of Network-Wide Cyber Situational Awareness via Graph-Based Analytics". In Complex Computational Ecosystems, 167–79. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-44355-8_12.
Texto completo da fonteDillencourt, Michael B., David Eppstein e DanielS Hirschberg. "Geometric Thickness of Complete Graphs". In Graph Drawing, 102–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-37623-2_8.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Graphe complet"
Molokwu, Bonaventure. "Event Prediction in Complex Social Graphs using One-Dimensional Convolutional Neural Network". 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/914.
Texto completo da fonteVargas, Hernán, Carlos Buil-Aranda, Aidan Hogan e Claudia López. "A User Interface for Exploring and Querying Knowledge Graphs (Extended Abstract)". In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/666.
Texto completo da fonteFeng, Lijin, e Jackson Barr. "Complete Graphs and Bipartite Graphs in a Random Graph". In 2021 5th International Conference on Vision, Image and Signal Processing (ICVISP). IEEE, 2021. http://dx.doi.org/10.1109/icvisp54630.2021.00054.
Texto completo da fonteBandeira, Bruno, Márcia R. Cerioli e Petrucio Viana. "Recognizing which Cographs are Set Graphs". In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/etc.2022.223265.
Texto completo da fonteShai, Offer. "Topological Synthesis of All 2D Mechanisms Through Assur Graphs". In ASME 2010 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/detc2010-28926.
Texto completo da fonteKasyanov, Victor Nikolaevich, Elena Viktorovna Kasyanova e Timur Alexandrovich Zolotuhin. "Information Visualization Based on Attributed Hierarchical Graphs with Ports". In 32nd International Conference on Computer Graphics and Vision. Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/graphicon-2022-211-217.
Texto completo da fonteLu, Zhiyuan, Yuan Fang, Cheng Yang e Chuan Shi. "Heterogeneous Graph Transformer with Poly-Tokenization". In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. California: International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/247.
Texto completo da fonteSantos, Tanilson D., Jayme Szwarcfiter, Uéverton S. Souza e Claudson F. Bornstein. "On the Helly Property of Some Intersection Graphs". In Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação, 2021. http://dx.doi.org/10.5753/ctd.2021.15752.
Texto completo da fonteKovalev, Mikhail Dmitrievich. "On structural graphs of theory of mechanisms". In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-74.
Texto completo da fonteDe Silva, K. H. C., e A. A. I. Perera. "Odd Prime Labeling of Snake Graphs". In SLIIT 2nd International Conference on Engineering and Technology. SLIIT, 2023. http://dx.doi.org/10.54389/lufm4069.
Texto completo da fonteRelatórios de organizações sobre o assunto "Graphe complet"
Thulasidasan, Sunil. The Graph Laplacian and the Dynamics of Complex Networks. Office of Scientific and Technical Information (OSTI), junho de 2012. http://dx.doi.org/10.2172/1043504.
Texto completo da fonteFait, Aaron, Grant Cramer e Avichai Perl. Towards improved grape nutrition and defense: The regulation of stilbene metabolism under drought. United States Department of Agriculture, maio de 2014. http://dx.doi.org/10.32747/2014.7594398.bard.
Texto completo da fonteKriegel, Francesco. Learning description logic axioms from discrete probability distributions over description graphs (Extended Version). Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.247.
Texto completo da fonteLiu, Di-Jia. “Graphene-Wrapped” Complex Hydrides as High-Capacity, Regenerable Hydrogen Storage Materials. Office of Scientific and Technical Information (OSTI), novembro de 2018. http://dx.doi.org/10.2172/1490684.
Texto completo da fonteSoloviev, Vladimir, Victoria Solovieva, Anna Tuliakova, Alexey Hostryk e Lukáš Pichl. Complex networks theory and precursors of financial crashes. [б. в.], outubro de 2020. http://dx.doi.org/10.31812/123456789/4119.
Texto completo da fonteShah, Ayesha, Jan Olek e Rebecca S. McDaniel. Real Life Experience with Major Pavement Types. Purdue University, 2022. http://dx.doi.org/10.5703/1288284317371.
Texto completo da fonteTrammell, Michael P., e Peter J. Pappano. Analysis of Natural Graphite, Synthetic Graphite, and Thermosetting Resin Candidates for Use in Fuel Compact Matrix. Office of Scientific and Technical Information (OSTI), setembro de 2011. http://dx.doi.org/10.2172/1024284.
Texto completo da fonteQi, Fei, Zhaohui Xia, Gaoyang Tang, Hang Yang, Yu Song, Guangrui Qian, Xiong An, Chunhuan Lin e Guangming Shi. A Graph-based Evolutionary Algorithm for Automated Machine Learning. Web of Open Science, dezembro de 2020. http://dx.doi.org/10.37686/ser.v1i2.77.
Texto completo da fonteKriegel, Francesco. Efficient Axiomatization of OWL 2 EL Ontologies from Data by means of Formal Concept Analysis. Technische Universität Dresden, 2023. http://dx.doi.org/10.25368/2023.214.
Texto completo da fonteAguilera-Díaz, María Modesta. Habitantes del agua: El complejo lagunar de la Ciénaga Grande de Santa Marta. Bogotá, Colombia: Banco de la República, maio de 2011. http://dx.doi.org/10.32468/dtseru.144.
Texto completo da fonte