Готові списки джерел за темами / Graphe complet

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Graphe complet"

Автор: Grafiati

Опубліковано: 2 листопада 2024

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Graphe complet".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Graphe complet"

Potgieter, Zelda. "Lacan’s three orders, the graphe complet and music in film:." Communicare: Journal for Communication Studies in Africa 26, no. 1 (2022): 1–26. http://dx.doi.org/10.36615/jcsa.v26i1.1708.

Повний текст джерела

Анотація:

This article engages with the Lacanian tradition of film theory in order to suggest some of the waysin which music in film may be understood to contribute significantly to subject identification in filmicexperience. Two points are argued: 1) that Lacan’s distinction between the three orders - the Real,the Imaginary and the Symbolic - may usefully be understood in musical terms, and, 2) that thetwo vectors of Lacan’s graphe complet – the vector of speech and the vector of drive – providemeaningful insight into the manner in which the three orders shape filmic musical experience.Analysis of Mikl

Стилі APA, Harvard, Vancouver, ISO та ін.

Wafiq, Hibi. "Non-Isomorphism Between Graph And Its Complement." Multicultural Education 7, no. 6 (2021): 256. https://doi.org/10.5281/zenodo.4965942.

Повний текст джерела

Анотація:

It is known that any graph with six vertices cannot be isomorphic to its complement [3].V. K. Balakrishnan has written in his book Schaum’s solved problems series [1] the following: “Given two arbitrary Simple graphs of the same order and the same size, the problem of determining whetheran isomorphism exists between the two is known as the isomorphism problem in graph theory. In general, itis not all easy (in other words, there is no "efficient algorithm") to solve an arbitrary instance of the isomorphismproblem”, from here came the idea of this paper. As mentio

Стилі APA, Harvard, Vancouver, ISO та ін.

S., Sylvia Vergara. "Complete graph immersions in dense graphs." Discrete Mathematics 340, no. 5 (2017): 1019–27. http://dx.doi.org/10.1016/j.disc.2017.01.001.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Harris, Haylee Aileen. "The Coloring Graph of Complete Graphs." PUMP Journal of Undergraduate Research 2 (September 6, 2019): 150–60. http://dx.doi.org/10.46787/pump.v2i0.1448.

Повний текст джерела

Анотація:

We study the coloring graph of the family of complete graphs and we prove that Cn(Kt) is regular, transitive, and connected when n>t. Also, we study whether Cn(Kt) is distance transitive or strongly regular, and find its diameter.

Стилі APA, Harvard, Vancouver, ISO та ін.

Wang, Jinhua, and Dengju Ma. "Petersen Graph Decompositions of Complete Multipartite Graphs." Graphs and Combinatorics 26, no. 5 (2010): 737–44. http://dx.doi.org/10.1007/s00373-010-0925-x.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Erdős, P., and L. Pyber. "Covering a graph by complete bipartite graphs." Discrete Mathematics 170, no. 1-3 (1997): 249–51. http://dx.doi.org/10.1016/s0012-365x(96)00124-0.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

A, Punitha Tharani, and Saradha P. "Discrete Labeling of Graphs." Indian Journal of Science and Technology 17, SP1 (2024): 93–102. https://doi.org/10.17485/IJST/v17sp1.176.

Повний текст джерела

Анотація:

Abstract Objectives: To introduce a new type of labeling called Discrete Labeling. This labeling aims at providing the maximum output whenever the inputs are distinct with rational distribution of neighbours thereby exhibiting the stronger form of Cordial labeling. This work serves as an aid in decision-making. Methods: The discrete labels 0 and 1 are cordially assigned to the vertices such that the edges receive labels depending on the incident vertex labels using EX-OR operation with the condition that for every vertex the cardinality of neigh

Стилі APA, Harvard, Vancouver, ISO та ін.

Shelah, Saharon. "Universality among graphs omitting a complete bipartite graph." Combinatorica 32, no. 3 (2012): 325–62. http://dx.doi.org/10.1007/s00493-012-2033-4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Vijayalakshmi, S., S. Geetha, and S. Sahaya Arockia Selvi. "Complete Intuitionistic Fuzzy Graphs." International Journal of Science and Research (IJSR) 11, no. 11 (2022): 1021–26. http://dx.doi.org/10.21275/sr221107184909.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Abdul Razak, M. N. S., W. H. Fong, and N. H. Sarmin. "Graph splicing rules with cycle graph and its complement on complete graphs." Journal of Physics: Conference Series 1988, no. 1 (2021): 012067. http://dx.doi.org/10.1088/1742-6596/1988/1/012067.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "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.

Повний текст джерела

Анотація:

Les problèmes de domination (dominant, dominant indépendant, ...) et de couverture (vertex-cover, arbre de Steiner, ...) sont NP-complets. Pour autant, pour la plupart de ces problèmes, il existe toujours une solution constructible en temps polynomial (potentiellement de valeur objective très mauvaise), ou au moins, il est possible de déterminer facilement (en temps polynomial) l'existence ou non d'une solution. Ces problèmes, initialement issus de situations réelles, sont des modélisations simplistes de ces situations. Nous ajoutons donc des contraintes additionnelles modélisant des contraint

Стилі APA, Harvard, Vancouver, ISO та ін.

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.

Повний текст джерела

Анотація:

La thèse porte sur des problèmes de complexitè liés à des opération de décomposition de graphes. Etant donné un graphe donné H (clique, stable, biparti, graphe à seuil) et un graphe G n-apparié, on étudie la complexité algorithmique du problème suivant : Existe-t-il un sous-graphe induit de G qui contient exactement un sommet de chacune des n paires de G isomorphe à H?. On montrera enfin que le problème de décomposition des graphes appelés graphes Stubborn est équivalent au problème précédent pour un cas particulier de graphes n-appariés.

Стилі APA, Harvard, Vancouver, ISO та ін.

Sima, 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.

Повний текст джерела

Анотація:

La connaissance est essentielle pour les organisations, particulièrement dans le contexte de l'Industrie 4.0. La Gestion des Connaissances (GC) joue un rôle critique dans le succès des organisations. Bien que la GC ait été relativement bien étudiée dans les grandes organisations, les Petites et Moyennes Entreprises (PMEs) reçoivent moins d'attention. Les PMEs font face à des défis uniques en termes de GC, nécessitant un cadre de GC dédié. Notre étude vise à définir un cadre répondant à leurs défis tout en tirant parti de leurs forces inhérentes. Cette thèse présente un cadre de GC dédié et com

Стилі APA, Harvard, Vancouver, ISO та ін.

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.

Повний текст джерела

Анотація:

Ce travail de thèse s'inscrit dans le domaine de la recherche de structures dans un graphe. On é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 ch

Стилі APA, Harvard, Vancouver, ISO та ін.

Glorieux, Antoine. "Optimizing the imbalances in a graph." Thesis, Evry, Institut national des télécommunications, 2017. http://www.theses.fr/2017TELE0011/document.

Повний текст джерела

Анотація:

Le déséquilibre d'un sommet dans un graphe orienté est la valeur absolue de la différence entre son degré sortant et son degré entrant. Nous étudions le problème de trouver une orientation des arêtes du graphe telle que l'image du vecteur dont les composantes sont les déséquilibres des sommets par une fonction objectif f est maximisée. Le premier cas considéré est le problème de maximiser le minimum des déséquilibres sur toutes les orientations possibles. Nous caractérisons les graphes dont la valeur objective optimale est nulle. Ensuite nous donnons plusieurs résultats concernant la complexit

Стилі APA, Harvard, Vancouver, ISO та ін.

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.

Повний текст джерела

Анотація:

Стилі APA, Harvard, Vancouver, ISO та ін.

Halftermeyer, Pierre. "Connexité dans les Réseaux et Schémas d’Étiquetage Compact d’Urgence." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0140/document.

Повний текст джерела

Анотація:

L’objectif de cette thèse est d’attribuer à chaque sommet x d’un graphe G à n sommets une étiquette L(x) de taille compacte O(log n) bits afin de pouvoir :1. construire, à partir des étiquettes d’un ensemble de sommets en panne X C V (G), une structure de donnée S(X)2. décider, à partir de S(X) et des étiquettes L(u) et L(v), si les sommets u et v sont connectés dans le graphe G n X.Nous proposons une solution à ce problème pour la famille des graphes 3-connexes de genre g (via plusieurs résultats intermédiaires).— Les étiquettes sont de taille O(g log n) bits— Le temps de construction de la s

Стилі APA, Harvard, Vancouver, ISO та ін.

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.

Повний текст джерела

Анотація:

De nombreux systèmes complexes du monde réel peuvent être représentés par des graphes, où les nœuds représentent des entités et les liens des relations entre les paires de nœuds. La prédiction de liens (LP) est l'un des problèmes les plus intéressants et les plus anciens dans le domaine de l'exploration de graphes ; elle prédit la probabilité d'un lien entre deux nœuds non connectés. Cette thèse étudie le problème LP dans les graphes simples et les graphes de connaissances (KGs). La première partie de cette thèse se concentre sur le problème LP dans les graphes simples. Dans la première étude,

Стилі APA, Harvard, Vancouver, ISO та ін.

Dieng, Youssou. "Décomposition arborescente des graphes planaires et routage compact." Thesis, Bordeaux 1, 2009. http://www.theses.fr/2009BOR13855/document.

Повний текст джерела

Анотація:

Savoir comment transmettre une information est fondamental dans un réseau. Il est essentiel que chaque entité du réseau soit capable de décider localement, avec sa vue du réseau, du chemin par lequel l'information doit passer. Ainsi, il est souvent utile d'étudier la topologie du réseau, modélisée par un graphe, pour répondre à ces exigences. Nous nous intéressons dans un premier temps, à la décomposition arborescente des graphes planaires. En effet, comme dans beaucoup de problèmes de graphes, l'étude de la topologie des graphes nous conduit à procéder à une décomposition du graphe afin d'exp

Стилі APA, Harvard, Vancouver, ISO та ін.

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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Graphe complet"

Simmonds, William Francis. Complete parameterized presentations and almost convex Cayley graphs. typescript, 1991.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Scheffler, Petra. Linear-time algorithms for NP-complete problems restricted to partial k-trees. Akademie der Wissenschaften der DDR, Karl-Weierstrass-Institut für Mathematik, 1987.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

John, Wagner. The complete America. Titan, 2003.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Michael, Lark, ed. The compleat Terminal city. Dark Horse Books, 2012.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Publishing, Spark, ed. Complete curriculum. Spark Publishing, 2006.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Coolen, Ton, Alessia Annibale, and Ekaterina Roberts. Generating Random Networks and Graphs. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.001.0001.

Повний текст джерела

Анотація:

This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation,

Стилі APA, Harvard, Vancouver, ISO та ін.

Dorogovtsev, Sergey N., and José F. F. Mendes. The Nature of Complex Networks. Oxford University PressOxford, 2022. http://dx.doi.org/10.1093/oso/9780199695119.001.0001.

Повний текст джерела

Анотація:

Abstract The researchers studying complex networks will acquire from this advanced modern book a number of new issues and ideas, not yet touched upon in other reference volumes. The book considers a wide range of networks and processes taking place on them, paying particular attention to the recently developed directions, methods, and techniques. It proposes a statistical mechanics view of random networks based on the concept of statistical ensembles, but approaches and methods of modern graph theory, concerning random graphs, overlap strongly with statistical physics. Hence mathematicians hav

Стилі APA, Harvard, Vancouver, ISO та ін.

Kalia, Rajat. Complete Course in Physics (Graphs). Independently Published, 2017.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Complete Course in Physics ( Graphs ). Lulu Press, Inc., 2017.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Complete Course in Physics ( Graphs ). Lulu Press, Inc., 2017.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Graphe complet"

Gebhardt, Friedrich, Angi Voß, Wolfgang Gräther, and Barbara Schmidt-Belz. "Graphs." In Reasoning with Complex Cases. Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6233-7_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dondi, Riccardo, Pietro Hiram Guzzi, and Mohammad Mehdi Hosseinzadeh. "Integrating Temporal Graphs via Dual Networks: Dense Graph Discovery." In Complex Networks and Their Applications XI. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-21131-7_41.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Iordache, Octavian. "Existential Graphs." In Understanding Complex Systems. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17946-4_10.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kamiński, Bogumił, Paweł Prałat, and François Théberge. "Embedding Graphs." In Mining Complex Networks. Chapman and Hall/CRC, 2021. http://dx.doi.org/10.1201/9781003218869-9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Buchin, Kevin, Maike Buchin, Jaroslaw Byrka, et al. "Drawing (Complete) Binary Tanglegrams." In Graph Drawing. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00219-9_32.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kamiński, Bogumił, Paweł Prałat, and François Théberge. "Graph Embeddings." In Mining Complex Networks. Chapman and Hall/CRC, 2021. http://dx.doi.org/10.1201/9781003218869-6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kamiński, Bogumił, Paweł Prałat, and François Théberge. "Graph Theory." In Mining Complex Networks. Chapman and Hall/CRC, 2021. http://dx.doi.org/10.1201/9781003218869-1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kurasov, Pavel. "The Trace Formula." In Operator Theory: Advances and Applications. Springer Berlin Heidelberg, 2023. http://dx.doi.org/10.1007/978-3-662-67872-5_8.

Повний текст джерела

Анотація:

AbstractThis chapter is devoted to the trace formula connecting the spectrum of a finite compact metric graph with the set of closed paths on it. In other words this formula establishes a relation between spectral and geometric/topologic properties of metric graphs.

Стилі APA, Harvard, Vancouver, ISO та ін.

Dillencourt, Michael B., David Eppstein, and DanielS Hirschberg. "Geometric Thickness of Complete Graphs." In Graph Drawing. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-37623-2_8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Albrecht, Benjamin, Philip Effinger, Markus Held, Michael Kaufmann, and Stephan Kottler. "Visualization of Complex BPEL Models." In Graph Drawing. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11805-0_45.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Graphe complet"

Du, Junliang, Guiran Liu, Jia Gao, Xiaoxuan Liao, Jiacheng Hu, and Linxiao Wu. "Graph Neural Network-Based Entity Extraction and Relationship Reasoning in Complex Knowledge Graphs." In 2024 International Conference on Image Processing, Computer Vision and Machine Learning (ICICML). IEEE, 2024. https://doi.org/10.1109/icicml63543.2024.10958048.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

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}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/914.

Повний текст джерела

Анотація:

Social network graphs possess apparent and latent knowledge about their respective actors and links which may be exploited, using effective and efficient techniques, for predicting events within the social graphs. Understanding the intrinsic relationship patterns among spatial social actors and their respective properties are crucial factors to be taken into consideration in event prediction within social networks. My research work proposes a unique approach for predicting events in social networks by learning the context of each actor/vertex using neighboring actors in a given social graph wi

Стилі APA, Harvard, Vancouver, ISO та ін.

Vargas, Hernán, Carlos Buil-Aranda, Aidan Hogan, and 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}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/666.

Повний текст джерела

Анотація:

As the adoption of knowledge graphs grows, more and more non-experts users need to be able to explore and query such graphs. These users are not typically familiar with graph query languages such as SPARQL, and may not be familiar with the knowledge graph's structure. In this extended abstract, we provide a summary of our work on a language and visual interface -- called RDF Explorer -- that help non-expert users to navigate and query knowledge graphs. A usability study over Wikidata shows that users successfully complete more tasks with RDF Explorer than with the existing Wikidata Query Helpe

Стилі APA, Harvard, Vancouver, ISO та ін.

Feng, Lijin, and 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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Bandeira, Bruno, Márcia R. Cerioli, and 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.

Повний текст джерела

Анотація:

A set graph is a graph admitting an extensional acyclic orientation. The set graph recognition problem was first considered and proved to be NP-complete by A. Tomescu in 2012. In this work, we introduce two concepts that can be used for the efficient recognition of set graphs in some classes of graphs. We define layered extensional acyclic orientations and a graph parameter, called set-deficiency, that measures how far a graph is from being a set graph. Then, we describe how these concepts can be applied to recognize set graphs in the class of cographs in polynomial time.

Стилі APA, Harvard, Vancouver, ISO та ін.

Shai, 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.

Повний текст джерела

Анотація:

It is well known that every planar kinematical linkage can be decomposed into basic topological structures referred as Assur Groups. A new reformulation of Assur Group concept into the terminology of rigidity theory, as Assur Graphs, has yielded the development of new theorems and methods. The paper reports on an algorithm for systematic construction of Assur Graph classes, termed fundamental Assur Graphs. From each fundamental Assur Graph it is possible to derive an infinite set of different Assur Graphs. This mapping algorithm is proved to be complete and sound, i.e., all the Assur Graphs ap

Стилі APA, Harvard, Vancouver, ISO та ін.

Kasyanov, Victor Nikolaevich, Elena Viktorovna Kasyanova, and 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.

Повний текст джерела

Анотація:

Information visualization based on graph models has many applications in both real and theoretical fields. Since the information that it is desirable to visualize is constantly growing and becoming more complex, more powerful graph-theoretic formalisms are required and appear to represent structured information models with a hierarchical structure. One of these formalisms is the so-called attributed hierarchical graphs. It allows selecting in the original graph a set of such parts (so-called fragments) that all elements of each fragment deserve separate joint consideration, and all fragments o

Стилі APA, Harvard, Vancouver, ISO та ін.

Lu, Zhiyuan, Yuan Fang, Cheng Yang, and Chuan Shi. "Heterogeneous Graph Transformer with Poly-Tokenization." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/247.

Повний текст джерела

Анотація:

Graph neural networks have shown widespread success for learning on graphs, but they still face fundamental drawbacks, such as limited expressive power, over-smoothing, and over-squashing. Meanwhile, the transformer architecture offers a potential solution to these issues. However, existing graph transformers primarily cater to homogeneous graphs and are unable to model the intricate semantics of heterogeneous graphs. Moreover, unlike small molecular graphs where the entire graph can be considered as the receptive field in graph transformers, real-world heterogeneous graphs comprise a signific

Стилі APA, Harvard, Vancouver, ISO та ін.

Santos, Tanilson D., Jayme Szwarcfiter, Uéverton S. Souza, and 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.

Повний текст джерела

Анотація:

An EPG graph G is an edge-intersection graph of paths on a grid. In this thesis, we analyze structural characterizations and complexity aspects regarding EPG graphs. Our main focus is on the class of B1-EPG graphs whose intersection model satisfies well-known the Helly property, called Helly-B1-EPG. We show that the problem of recognizing Helly-B1-EPG graphs is NP-complete. Besides, other intersection graph classes such as VPG, EPT, and VPT were also studied. We completely solve the problem of determining the Helly and strong Helly numbers of Bk-EPG graphs and Bk-VPG graphs for each non-negati

Стилі APA, Harvard, Vancouver, ISO та ін.

Kovalev, 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.

Повний текст джерела

Анотація:

It is shown that the graph commonly used by machine scientists in the analysis structures of mechanisms does not always carry complete information about the structure. It is proposed to use more suitable graphs, in particular, a weighted graph that carries complete information.

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Graphe complet"

Thulasidasan, Sunil. The Graph Laplacian and the Dynamics of Complex Networks. Office of Scientific and Technical Information (OSTI), 2012. http://dx.doi.org/10.2172/1043504.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Fait, Aaron, Grant Cramer, and Avichai Perl. Towards improved grape nutrition and defense: The regulation of stilbene metabolism under drought. United States Department of Agriculture, 2014. http://dx.doi.org/10.32747/2014.7594398.bard.

Повний текст джерела

Анотація:

The goals of the present research proposal were to elucidate the physiological and molecular basis of the regulation of stilbene metabolism in grape, against the background of (i) grape metabolic network behavior in response to drought and of (ii) varietal diversity. The specific objectives included the study of the physiology of the response of different grape cultivars to continuous WD; the characterization of the differences and commonalities of gene network topology associated with WD in berry skin across varieties; the study of the metabolic response of developing berries to continuous WD

Стилі APA, Harvard, Vancouver, ISO та ін.

Wilke, Rudeger. Representing Complex Systems as Graphs for Debugging and Predictive Maintenance-Preliminary Thoughts. Office of Scientific and Technical Information (OSTI), 2025. https://doi.org/10.2172/2540215.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kriegel, 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.

Повний текст джерела

Анотація:

Description logics in their standard setting only allow for representing and reasoning with crisp knowledge without any degree of uncertainty. Of course, this is a serious shortcoming for use cases where it is impossible to perfectly determine the truth of a statement. For resolving this expressivity restriction, probabilistic variants of description logics have been introduced. Their model-theoretic semantics is built upon so-called probabilistic interpretations, that is, families of directed graphs the vertices and edges of which are labeled and for which there exists a probability measure o

Стилі APA, Harvard, Vancouver, ISO та ін.

Liu, Di-Jia. “Graphene-Wrapped” Complex Hydrides as High-Capacity, Regenerable Hydrogen Storage Materials. Office of Scientific and Technical Information (OSTI), 2018. http://dx.doi.org/10.2172/1490684.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Soloviev, Vladimir, Victoria Solovieva, Anna Tuliakova, Alexey Hostryk, and Lukáš Pichl. Complex networks theory and precursors of financial crashes. [б. в.], 2020. http://dx.doi.org/10.31812/123456789/4119.

Повний текст джерела

Анотація:

Based on the network paradigm of complexity in the work, a systematic analysis of the dynamics of the largest stock markets in the world and cryptocurrency market has been carried out. According to the algorithms of the visibility graph and recurrence plot, the daily values of stock and crypto indices are converted into a networks and multiplex networks, the spectral and topological properties of which are sensitive to the critical and crisis phenomena of the studied complex systems. This work is the first to investigate the network properties of the crypto index CCI30 and the multiplex networ

Стилі APA, Harvard, Vancouver, ISO та ін.

Shah, Ayesha, Jan Olek, and Rebecca S. McDaniel. Real Life Experience with Major Pavement Types. Purdue University, 2022. http://dx.doi.org/10.5703/1288284317371.

Повний текст джерела

Анотація:

Pavement performance is a complex issue which depends on many contributing factors. Examining the performance of real-life pavements across the state determines what the actual service lives are for the pavements. For the purposes of this study, only selected LTPP projects were examined, along with a database containing all the historic repair projects completed in Indiana. Pertinent information present in the Indiana Historic Contracts Database was extracted concerning the types of pavement repair and treatments options commonly employed within the state, the time between repairs, etc. These

Стилі APA, Harvard, Vancouver, ISO та ін.

Trammell, Michael P., and 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), 2011. http://dx.doi.org/10.2172/1024284.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Qi, Fei, Zhaohui Xia, Gaoyang Tang, et al. A Graph-based Evolutionary Algorithm for Automated Machine Learning. Web of Open Science, 2020. http://dx.doi.org/10.37686/ser.v1i2.77.

Повний текст джерела

Анотація:

As an emerging field, Automated Machine Learning (AutoML) aims to reduce or eliminate manual operations that require expertise in machine learning. In this paper, a graph-based architecture is employed to represent flexible combinations of ML models, which provides a large searching space compared to tree-based and stacking-based architectures. Based on this, an evolutionary algorithm is proposed to search for the best architecture, where the mutation and heredity operators are the key for architecture evolution. With Bayesian hyper-parameter optimization, the proposed approach can automate th

Стилі APA, Harvard, Vancouver, ISO та ін.

Kriegel, 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.

Повний текст джерела

Анотація:

We present an FCA-based axiomatization method that produces a complete EL TBox (the terminological part of an OWL 2 EL ontology) from a graph dataset in at most exponential time. We describe technical details that allow for efficient implementation as well as variations that dispense with the computation of extremely large axioms, thereby rendering the approach applicable albeit some completeness is lost. Moreover, we evaluate the prototype on real-world datasets.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!