Добірка наукової літератури з теми "Graphe complet"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Graphe complet".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Graphe complet"
1
Potgieter, Zelda. "Lacan’s three orders, the graphe complet and music in film:." Communicare: Journal for Communication Studies in Africa 26, no. 1 (October 20, 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 Miklos Rosza’s score for Alfred Hitchcock’s Spellbound (1945) serves to illustrate suchinsights.
2
Cappelletti, 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, no. 6 (June 26, 2023): 552–68. http://dx.doi.org/10.1038/s43588-023-00465-8.
Повний текст джерелаАнотація:
AbstractGraph representation learning methods opened new avenues for addressing complex, real-world problems represented by graphs. However, many graphs used in these applications comprise millions of nodes and billions of edges and are beyond the capabilities of current methods and software implementations. We present GRAPE (Graph Representation Learning, Prediction and Evaluation), a software resource for graph processing and embedding that is able to scale with big graphs by using specialized and smart data structures, algorithms, and a fast parallel implementation of random-walk-based methods. Compared with state-of-the-art software resources, GRAPE shows an improvement of orders of magnitude in empirical space and time complexity, as well as competitive edge- and node-label prediction performance. GRAPE comprises approximately 1.7 million well-documented lines of Python and Rust code and provides 69 node-embedding methods, 25 inference models, a collection of efficient graph-processing utilities, and over 80,000 graphs from the literature and other sources. Standardized interfaces allow a seamless integration of third-party libraries, while ready-to-use and modular pipelines permit an easy-to-use evaluation of graph-representation-learning methods, therefore also positioning GRAPE as a software resource that performs a fair comparison between methods and libraries for graph processing and embedding.
3
Ismayil, A. Mohamed, and N. Azhagendran. "Isomorphism on Complex Fuzzy Graph." Indian Journal Of Science And Technology 17, SPI1 (April 25, 2024): 86–92. http://dx.doi.org/10.17485/ijst/v17sp1.165.
Повний текст джерелаАнотація:
Objective: To investigate isomorphism between two complex fuzzy graphs and prove it is an equivalence relation. The major objective of this research paper is to elucidate weak and strong isomorphism, and the study also endeavours to look at the complement of complex fuzzy graphs. Methods: Isomorphism is examined by comparing the membership values of nodes and arcs (both amplitude and phase). The same technique also proves further validation of the equivalence relation, which is also proven by the same technique. This criterion helps us to identify and formalise the isomorphic relationship between complex fuzzy graphs. Findings: This study demonstrates that isomorphism in complex fuzzy graphs allows for consideration of graph structures' differences and similarities. It provides for a better understanding of significant connections between complex fuzzy graphs. Novelty: By offering an elaborate perception of the idea of isomorphism in complex fuzzy graphs, this work advances the discipline. It seeks a better understanding of the complexities of equivalency determination for complicated structures, as well as the application of isomorphism theory to complex fuzzy graphs. Keywords: Complex fuzzy graph, Homomorphism, Isomorphism, Partial order relation, Self complementary
4
Hanif, S., K. A. Bhat, and G. Sudhakara. "Complete (2,2) Bipartite Graphs." Malaysian Journal of Mathematical Sciences 16, no. 2 (April 29, 2022): 379–90. http://dx.doi.org/10.47836/mjms.16.2.13.
Повний текст джерелаАнотація:
A bipartite graph G can be treated as a (1,1) bipartite graph in the sense that, no two vertices in the same part are at distance one from each other. A (2,2) bipartite graph is an extension of the above concept in which no two vertices in the same part are at distance two from each other. In this article, analogous to complete (1,1) bipartite graphs which have the maximum number of pairs of vertices having distance one between them, a complete (2,2) bipartite graph is defined as follows. A complete (2,2) bipartite graph is a graph which is (2,2) bipartite and has the maximum number of pairs of vertices (u,v) such that d(u,v)=2. Such graphs are characterized and their properties are studied. The expressions are derived for the determinant, the permanent and spectral properties of some classes of complete (2,2) bipartite graphs. A class of graphs among complete (2,2) bipartite graphs having golden ratio in their spectrum is obtained.
5
Chen, Yuzhong, Zhenyu Liu, Yulin Liu, and Chen Dong. "Distributed Attack Modeling Approach Based on Process Mining and Graph Segmentation." Entropy 22, no. 9 (September 14, 2020): 1026. http://dx.doi.org/10.3390/e22091026.
Повний текст джерелаАнотація:
Attack graph modeling aims to generate attack models by investigating attack behaviors recorded in intrusion alerts raised in network security devices. Attack models can help network security administrators discover an attack strategy that intruders use to compromise the network and implement a timely response to security threats. However, the state-of-the-art algorithms for attack graph modeling are unable to obtain a high-level or global-oriented view of the attack strategy. To address the aforementioned issue, considering the similarity between attack behavior and workflow, we employ a heuristic process mining algorithm to generate the initial attack graph. Although the initial attack graphs generated by the heuristic process mining algorithm are complete, they are extremely complex for manual analysis. To improve their readability, we propose a graph segmentation algorithm to split a complex attack graph into multiple subgraphs while preserving the original structure. Furthermore, to handle massive volume alert data, we propose a distributed attack graph generation algorithm based on Hadoop MapReduce and a distributed attack graph segmentation algorithm based on Spark GraphX. Additionally, we conduct comprehensive experiments to validate the performance of the proposed algorithms. The experimental results demonstrate that the proposed algorithms achieve considerable improvement over comparative algorithms in terms of accuracy and efficiency.
6
DEACONU, VALENTIN, ALEX KUMJIAN, and JOHN QUIGG. "Group actions on topological graphs." Ergodic Theory and Dynamical Systems 32, no. 5 (September 16, 2011): 1527–66. http://dx.doi.org/10.1017/s014338571100040x.
Повний текст джерелаАнотація:
AbstractWe define the action of a locally compact groupGon a topological graphE. This action induces a natural action ofGon theC*-correspondence ℋ(E) and on the graphC*-algebraC*(E). If the action is free and proper, we prove thatC*(E)⋊rGis strongly Morita equivalent toC*(E/G) . We define the skew product of a locally compact groupGby a topological graphEvia a cocyclec:E1→G. The group acts freely and properly on this new topological graphE×cG. IfGis abelian, there is a dual action onC*(E) such that$C^*(E)\rtimes \hat {G}\cong C^*(E\times _cG)$. We also define the fundamental group and the universal covering of a topological graph.
7
Shukla, Samir, Shuchita Goyal, and Anurag Singh. "Homotopy Type of Independence Complexes of Certain Families of Graphs." Contributions to Discrete Mathematics 16, no. 3 (December 31, 2021): 74–92. http://dx.doi.org/10.55016/ojs/cdm.v16i3.71284.
Повний текст джерелаАнотація:
We show that the independence complexes of generalised Mycielskian of complete graphs are homotopy equivalent to a wedge sum of spheres, and determine the number of copies and the dimensions of these spheres. We also prove that the independence complexes of categorical product of complete graphs are wedge sum of circles, upto homotopy. Further, we show that if we perturb a graph $G$ in a certain way, then the independence complex of this new graph is homotopy equivalent to the suspension of the independence complex of $G$.
8
Ji, Shengwei, Chenyang Bu, Lei Li, and Xindong Wu. "Local Graph Edge Partitioning." ACM Transactions on Intelligent Systems and Technology 12, no. 5 (October 31, 2021): 1–25. http://dx.doi.org/10.1145/3466685.
Повний текст джерелаАнотація:
Graph edge partitioning, which is essential for the efficiency of distributed graph computation systems, divides a graph into several balanced partitions within a given size to minimize the number of vertices to be cut. Existing graph partitioning models can be classified into two categories: offline and streaming graph partitioning models. The former requires global graph information during the partitioning, which is expensive in terms of time and memory for large-scale graphs. The latter creates partitions based solely on the received graph information. However, the streaming model may result in a lower partitioning quality compared with the offline model. Therefore, this study introduces a Local Graph Edge Partitioning model, which considers only the local information (i.e., a portion of a graph instead of the entire graph) during the partitioning. Considering only the local graph information is meaningful because acquiring complete information for large-scale graphs is expensive. Based on the Local Graph Edge Partitioning model, two local graph edge partitioning algorithms—Two-stage Local Partitioning and Adaptive Local Partitioning—are given. Experimental results obtained on 14 real-world graphs demonstrate that the proposed algorithms outperform rival algorithms in most tested cases. Furthermore, the proposed algorithms are proven to significantly improve the efficiency of the real graph computation system GraphX.
9
Lu, Jing, Hafiz Mutee-ur-Rehman, Saima Nazeer, and Xuemei An. "The Edge-Weighted Graph Entropy Using Redefined Zagreb Indices." Mathematical Problems in Engineering 2022 (March 28, 2022): 1–12. http://dx.doi.org/10.1155/2022/5958913.
Повний текст джерелаАнотація:
Measurements of graphs and retrieving structural information of complex networks using degree-based network entropy have become an informational theoretical concept. This terminology is extended by the concept of Shannon entropy. In this paper, we introduce entropy with graphs having edge weights which are basically redefined Zagreb indices. Some bounds are calculated to idealize the performance in limiting different kinds of graph entropy. In addition, we discuss the structural complexity of connected graphs representing chemical structures. In this article, we have discussed the edge-weighted graph entropy with fixed number of vertices, with minimum and maximum degree of a vertex, regular graphs, complete graphs, complete bipartite graphs, and graphs associated with chemical structures.
10
R., Hemalatha, and K. Somasundaram. "SOMBOR INDEX OF EDGE CORONA PRODUCT OF SOME CLASSES OF GRAPHS." South East Asian J. of Mathematics and Mathematical Sciences 18, no. 03 (December 30, 2022): 307–16. http://dx.doi.org/10.56827/seajmms.2022.1803.25.
Повний текст джерелаАнотація:
The operations of graphs spread their wings in designing complex net- work structures in various engineering domains. Graph indices, popularly termed topological indices are computed on the basis of distance or degree. The boundless part of graph indices has its foot print in network centrality and the robustness of complex networks. The goal of this paper is to provide a complete expression for the Sombor index of edge corona product of few classes of graphs.
Дисертації з теми "Graphe complet"
1
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 contraintes pratiques plausibles : les conflits, des paires d'éléments ne pouvant faire simultanément partie d'une solution (modélisant des incompatibilités diverses), la connexité dans un second graphe (les éléments doivent pouvoir communiquer, et le graphe correspondant à ces liens de communication n'est pas forcément le même) et les obligations, des sous-ensembles d'éléments interdépendants devant être ajoutés simultanément à une solution. Notre but ici n'est pas de modéliser un problème réel précis, mais d'étudier la manière dont ces contraintes modifient la complexité des problèmes étudiés. Nous verrons que dans un grand nombre de cas, déterminer l'existence même d'une solution devient difficile, même sans se préoccuper de leur optimisation. Le problème du firefighter modélise des pompiers tentant de contenir un feu se propageant au tour par tour dans un graphe (potentiellement infini). Nous avons étudié ce problème en ajoutant des contraintes sur le déplacement des pompiers (une vitesse de déplacement limitée entre deux tours). Nous verrons que ces contraintes augmentent en général le nombre de pompiers nécessaires mais ne provoquent pas de changements aussi importants que dans les problèmes précédentsDomination 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
2
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.
3
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 complet pour les PMEs, offrant des solutions dédiées pour l’ensemble des activités de GC, de l'acquisition et la représentation des connaissances à leur exploitation: (1) un processus d'acquisition de connaissances dédié basé sur le cadre Scrum, une méthodologie agile, (2) un modèle de représentation des connaissances dédié basé sur des graphes de connaissances semi-structurés, et (3) un processus d'exploitation des connaissances dédié basé sur le système de recommandation établi sur les liens entre les connaissances. Cette recherche a été menée en collaboration avec Axsens-bte, une PME spécialisée dans le conseil et la formation. Le partenariat avec Axsens-bte a fourni des retours précieux et des expériences pratiques, contribuant au développement du cadre de GC proposé et soulignant sa pertinence et son applicabilité dans des contextes réels de PMEKnowledge 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
4
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 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.
5
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é du problème. Enfin, nous introduisons différentes formulations du problème et présentons quelques résultats numériques. Par la suite, nous montrons que le cas f=1/2 | |·| |₁ mène au célèbre problème de la coupe de cardinalité maximale. Nous introduisons de nouvelles formulations ainsi qu'un nouveau majorant qui domine celui de Goemans et Williamson. Des résultats théoriques et numériques concernant la performance des approches sont présentés. Pour finir, dans le but de renforcer certaines des formulations des problèmes étudiés, nous étudions une famille de polyèdres spécifique consistant en l'enveloppe convexe des matrices d'affectation 0/1 (où chaque colonne contient exactement une composante égale à 1) annexée avec l'indice de leur ligne non-identiquement nulle la plus basse. Nous donnons une description complète de ce polytope ainsi que certaines de ses variantes qui apparaissent naturellement dans le contexte de divers problèmes d'optimisation combinatoire. Nous montrons également que résoudre un programme linéaire sur un tel polytope peut s'effectuer en temps polynomialThe 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
6
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.
Повний текст джерелаАнотація:
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é du problème. Enfin, nous introduisons différentes formulations du problème et présentons quelques résultats numériques. Par la suite, nous montrons que le cas f=1/2 | |·| |₁ mène au célèbre problème de la coupe de cardinalité maximale. Nous introduisons de nouvelles formulations ainsi qu'un nouveau majorant qui domine celui de Goemans et Williamson. Des résultats théoriques et numériques concernant la performance des approches sont présentés. Pour finir, dans le but de renforcer certaines des formulations des problèmes étudiés, nous étudions une famille de polyèdres spécifique consistant en l'enveloppe convexe des matrices d'affectation 0/1 (où chaque colonne contient exactement une composante égale à 1) annexée avec l'indice de leur ligne non-identiquement nulle la plus basse. Nous donnons une description complète de ce polytope ainsi que certaines de ses variantes qui apparaissent naturellement dans le contexte de divers problèmes d'optimisation combinatoire. Nous montrons également que résoudre un programme linéaire sur un tel polytope peut s'effectuer en temps polynomialThe 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
7
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 structure de donnée S(X) est O(Sort([X]; n)).— Le temps de décision est O(log log n). Ce temps est optimal.Nous étendons ce résultat à la famille des graphes excluant un mineur H fixé. Les étiquettes sont ici de taille O(polylog n) bitsWe 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
8
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, des approches basées sur la similarité et sur l'encastrement sont évaluées et comparées sur des graphes simples de différents domaines. L'étude a également identifié la difficulté de fixer le seuil du score de similarité pour calculer la métrique de précision des approches basées sur la similarité et a proposé une nouvelle méthode pour calculer la métrique. Les résultats ont montré la supériorité attendue des approches basées sur l'intégration. Cependant, chaque approche basée sur la similarité s'est avérée compétitive sur des graphes aux propriétés spécifiques. Nous avons pu vérifier expérimentalement que les approches basées sur la similarité sont explicables mais manquent de généralisation, tandis que les approches basées sur l'encastrement sont générales mais non explicables. La deuxième étude tente de surmonter la limitation de l'inexplicabilité des approches basées sur l'encastrement en découvrant des connexions intéressantes entre elles et les approches basées sur la similarité. La troisième étude démontre comment les approches basées sur la similarité peuvent être assemblées pour concevoir une approche LP supervisée explicable. Il est intéressant de noter que l'étude montre des performances LP élevées pour l'approche supervisée sur différents graphes, ce qui est très satisfaisant. La deuxième partie de la thèse se concentre sur les LP dans les KGs. Un KG est représenté comme une collection de triplets RDF, (head,relation,tail) où les entités head et tail sont reliées par une relation spécifique. Le problème de LP dans un KG est formulé comme la prédiction de la tête ou de la queue manquante dans un triplet. La LP basée sur l'incorporation de KG est devenue très populaire ces dernières années, et la génération de triplets négatifs est une tâche importante dans les méthodes d'incorporation. La quatrième étude traite d'une nouvelle méthode appelée SNS pour générer des triplets négatifs de haute qualité. Nos résultats montrent une meilleure performance LP lorsque SNS est utilisé que lorsque d'autres méthodes d'échantillonnage négatif sont utilisées. La deuxième étude traite d'une nouvelle méthode d'extraction de règles neuro-symboliques et d'une stratégie d'abduction pour expliquer les LP par une approche basée sur l'intégration en utilisant les règles apprises. La troisième étude applique notre LP explicable pour développer une nouvelle approche de repositionnement des médicaments pour COVID-19. L'approche apprend un ensemble d'enchâssements d'entités et de relations dans un KG centré sur COVID-19 pour obtenir un meilleur enchâssement des éléments du graphe. Pour la première fois à notre connaissance, des méthodes de criblage virtuel sont ensuite utilisées pour évaluer les prédictions obtenues à l'aide des embeddings. L'évaluation moléculaire et les chemins explicatifs apportent de la fiabilité aux résultats de prédiction et sont de nouvelles méthodes complémentaires et réutilisables pour mieux évaluer les molécules proposées pour le repositionnement. La dernière étude propose une architecture distribuée pour l'apprentissage des KG embeddings dans des environnements distribués et parallèles. Les résultats révèlent que l'apprentissage dans l'environnement distribué proposé, par rapport à un apprentissage centralisé, réduit considérablement le temps de calcul des méthodes d'incorporation KG sans affecter les performances des LPMany 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
9
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'exploiter les propriétés structurelles qui en découlent. En suite, nous nous sommes aussi intéressés à la structure des graphes qui excluent un mineur H, en particulier le graphe K_{2,r}. Ces travaux nous ont permis d'améliorer les bornes actuelles connues sur la largeur arborescente de ces graphes. Dans la dernière partie, nous abordons le problème du routage compact. Nous nous sommes intéressés aux schémas de routage de plus courts chemins utilisant des adresses, des tables de routage de tailles optimales de O(log n) bits, où n est le nombre de sommets du graphe. Nous proposons un tel schéma de routage pour une famille de graphes valués contenant les arbres et les graphes planaire-extérieursIn 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
10
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.
Повний текст джерелаКниги з теми "Graphe complet"
1
Simmonds, William Francis. Complete parameterized presentations and almost convex Cayley graphs. [s.l.]: typescript, 1991.
Знайти повний текст джерела
2
Scheffler, 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.
Знайти повний текст джерела
3
John, Wagner. The complete America. London: Titan, 2003.
Знайти повний текст джерела
4
Michael, Lark, ed. The compleat Terminal city. Milwaukie, OR: Dark Horse Books, 2012.
Знайти повний текст джерела
5
Publishing, Spark, ed. Complete curriculum. New York: Spark Publishing, 2006.
Знайти повний текст джерела
6
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, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of random graph generation. This book is aimed at the graduate student or advanced undergraduate. It includes many worked examples, numerical simulations and exercises making it suitable for use in teaching. Explicit pseudocode algorithms are included to make the ideas easy to apply. Datasets are becoming increasingly large and network applications wider and more sophisticated. Testing hypotheses against properly specified control cases (null models) is at the heart of the ‘scientific method’. Knowledge on how to generate controlled and unbiased random graph ensembles is vital for anybody wishing to apply network science in their research.
7
Kalia, Rajat. Complete Course in Physics (Graphs). Independently Published, 2017.
Знайти повний текст джерела
8
Complete Course in Physics ( Graphs ). Lulu Press, Inc., 2017.
Знайти повний текст джерела
9
Complete Course in Physics ( Graphs ). Lulu Press, Inc., 2017.
Знайти повний текст джерела
10
Complete Course in Physics ( Graphs ). Lulu Press, Inc., 2017.
Знайти повний текст джерелаЧастини книг з теми "Graphe complet"
1
Gebhardt, Friedrich, Angi Voß, Wolfgang Gräther, and 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.
Повний текст джерела
2
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, 523–35. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-21131-7_41.
Повний текст джерела
3
Iordache, 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.
Повний текст джерела
4
Kamiński, Bogumił, Paweł Prałat, and 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.
Повний текст джерела
5
Kamiński, Bogumił, Paweł Prałat, and 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.
Повний текст джерела
6
Kamiński, Bogumił, Paweł Prałat, and 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.
Повний текст джерела
7
Buchin, Kevin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, and 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.
Повний текст джерела
8
Kurasov, 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.
Повний текст джерелаАнотація:
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.
9
Husák, Martin, Joseph Khoury, Đorđe Klisura, and 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.
Повний текст джерелаАнотація:
AbstractIn this paper, we posit how semi-static (i.e., not changing very often) complex computer network-based intelligence using graph-based analytics can become enablers of Cyber Situational Awareness (CSA) (i.e., perception, comprehension, and projection of situations in a cyber environment). A plethora of newly surfaced cyber security researchers have used graph-based analytics to facilitate particular down tasks in dynamic complex cyber environments. This includes graph-, node- and edge-level detection, classification, and others (e.g., credit card fraudulent transactions as an edge classification problem). To the best of our knowledge, very limited efforts have consolidated the outputs of heterogeneous computer network monitoring and reconnaissance tools (e.g., Nmap) in enabling actionable CSA. As such, in this work, we address this literature gap while describing several use cases of graph traversal, graph measures, and subgraph mining in vulnerability and security state assessment, attack projection and mitigation, and device criticality estimation. We highlight the benefits of the graph-based approaches compared to traditional methods. Finally, we postulate open research and application challenges in graph-based analytics for CSA to prompt promising research directions and operational capabilities.
10
Dillencourt, Michael B., David Eppstein, and 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.
Повний текст джерелаТези доповідей конференцій з теми "Graphe complet"
1
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.
Повний текст джерелаАнотація:
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 with the goal of generating vector-space embeddings for each vertex. Our methodology introduces a pre-convolution layer which is essentially a set of feature-extraction operations aimed at reducing the graph's dimensionality to aid knowledge extraction from its complex structure. Consequently, the low-dimensional node embeddings are introduced as input features to a one-dimensional ConvNet model for event prediction about the given social graph. Training and evaluation of this proposed approach have been done on datasets (compiled: November, 2017) extracted from real world social networks with respect to 3 European countries. Each dataset comprises an average of 280,000 links and 48,000 actors.
2
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}. California: 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 Helper interface.
3
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.
Повний текст джерела
4
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.
5
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 appear in the map and each graph in the map is an Assur Graph. Once we possess the mapping of all the Assur Graphs, all valid kinematical linkage topologies can be constructed through various Assur Graph compositions.
6
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 of the selected set form a nesting hierarchy. Visual Graph is a visualization system which is constructed at the A.P. Ershov Institute of Informatics Systems to explore complex structured big data through their visual representations based on attributed hierarchical graphs. In many applications, objects modeled by graph vertices are complex and contain non-intersecting logical parts (so called ports) through which these objects are in a relationship modeled by arcs. In this paper a formalism of attributed hierarchical graphs with ports and new possibilities of the Visual Graph system for information visualization based on this graph formalism are considered.
7
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}. California: 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 significantly larger number of nodes and cannot be entirely treated as such. Consequently, existing graph transformers struggle to capture the long-range dependencies in these complex heterogeneous graphs. To address these two limitations, we present Poly-tokenized Heterogeneous Graph Transformer (PHGT), a novel transformer-based heterogeneous graph model. In addition to traditional node tokens, PHGT introduces a novel poly-token design with two more token types: semantic tokens and global tokens. Semantic tokens encapsulate high-order heterogeneous semantic relationships, while global tokens capture semantic-aware long-range interactions. We validate the effectiveness of PHGT through extensive experiments on standardized heterogeneous graph benchmarks, demonstrating significant improvements over state-of-the-art heterogeneous graph representation learning models.
8
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-negative integer k. Finally, we show that every Chordal B1-EPG graph is at the intersection of VPT and EPT.
9
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.
10
De Silva, K. H. C., and 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.
Повний текст джерелаАнотація:
Graph theory is one of the branches of mathematics which is concerned with the networks of points connected by lines. One of the most important research areas in graph theory is graph labeling, which dates back to the 1960s. Graph labeling is assigning integers to the vertices, edges, or both depending on conditions. Labeled graphs are helpful in mathematical models for a wide range of applications such as in coding theory, circuit theory, computer networks, and in cryptography as well. There are various types of graph labeling techniques in graph theory such as radio labeling, graceful labeling, prime labeling, antimagic labeling, and lucky labeling, etc. In this research, we use one of the variations of prime labeling called odd prime labeling of snake graphs. Recent works on odd prime labeling investigate about families of snake graphs, complete graphs, etc and there they discuss about one odd integer sequence only. In this research, we introduce odd prime labeling method for snake graphs for any odd integer sequence and we give a proof for it as well. KEYWORDS: snake graph, odd sequences, odd prime labeling, relatively prime
Звіти організацій з теми "Graphe complet"
1
Thulasidasan, Sunil. The Graph Laplacian and the Dynamics of Complex Networks. Office of Scientific and Technical Information (OSTI), June 2012. http://dx.doi.org/10.2172/1043504.
Повний текст джерела
2
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, May 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 with specific attention to the stilbene compounds; the integration analysis of the omics data generated; the study of isolated drought-associated stress factors on the regulation of stilbene biosynthesis in plantaand in vitro. Background to the topic Grape quality has a complex relationship with water input. Regulated water deficit (WD) is known to improve wine grapes by reducing the vine growth (without affecting fruit yield) and boosting sugar content (Keller et al. 2008). On the other hand, irregular rainfall during the summer can lead to drought-associated damage of fruit developmental process and alter fruit metabolism (Downey et al., 2006; Tarara et al., 2008; Chalmers et al., 792). In areas undergoing desertification, WD is associated with high temperatures. This WD/high temperature synergism can limit the areas of grape cultivation and can damage yields and fruit quality. Grapes and wine are the major source of stilbenes in human nutrition, and multiple stilbene-derived compounds, including isomers, polymers and glycosylated forms, have also been characterized in grapes (Jeandet et al., 2002; Halls and Yu, 2008). Heterologous expression of stilbenesynthase (STS) in a variety of plants has led to an enhanced resistance to pathogens, but in others the association has not been proven (Kobayashi et al., 2000; Soleas et al., 1995). Tomato transgenic plants harboring a grape STS had increased levels of resveratrol, ascorbate, and glutathione at the expense of the anthocyanin pathways (Giovinazzo et al. 2005), further emphasizing the intermingled relation among secondary metabolic pathways. Stilbenes are are induced in green and fleshy parts of the berries by biotic and abiotic elicitors (Chong et al., 2009). As is the case for other classes of secondary metabolites, the biosynthesis of stilbenes is not very well understood, but it is known to be under tight spatial and temporal control, which limits the availability of these compounds from plant sources. Only very few studies have attempted to analyze the effects of different environmental components on stilbene accumulation (Jeandet et al., 1995; Martinez-Ortega et al., 2000). Targeted analyses have generally shown higher levels of resveratrol in the grape skin (induced), in seeded varieties, in varieties of wine grapes, and in dark-skinned varieties (Gatto et al., 2008; summarized by Bavaresco et al., 2009). Yet, the effect of the grape variety and the rootstock on stilbene metabolism has not yet been thoroughly investigated (Bavaresco et al., 2009). The study identified a link between vine hydraulic behavior and physiology of stress with the leaf metabolism, which the PIs believe can eventually lead to the modifications identified in the developing berries that interested the polyphenol metabolism and its regulation during development and under stress. Implications are discussed below.
3
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 on this graph family. Results of scientific experiments, e.g., in medicine, psychology, or biology, that are repeated several times can induce probabilistic interpretations in a natural way. In this document, we shall develop a suitable axiomatization technique for deducing terminological knowledge from the assertional data given in such probabilistic interpretations. More specifically, we consider a probabilistic variant of the description logic EL⊥, and provide a method for constructing a set of rules, so-called concept inclusions, from probabilistic interpretations in a sound and complete manner.
4
Liu, Di-Jia. “Graphene-Wrapped” Complex Hydrides as High-Capacity, Regenerable Hydrogen Storage Materials. Office of Scientific and Technical Information (OSTI), November 2018. http://dx.doi.org/10.2172/1490684.
Повний текст джерела
5
Soloviev, Vladimir, Victoria Solovieva, Anna Tuliakova, Alexey Hostryk, and Lukáš Pichl. Complex networks theory and precursors of financial crashes. [б. в.], October 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 network of key cryptocurrencies. It is shown that some of the spectral and topological characteristics can serve as measures of the complexity of the stock and crypto market, and their specific behaviour in the pre-crisis period is used as indicators- precursors of critical phenomena.
6
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 data were used to determine descriptive statistical parameters and was summarized in graph form. Similarly, data about selected LTPP GPS and SPS sites were downloaded from the online website, LTPP InfoPave and a comparative study between companion sites was performed. These data included study site and pavement-related information, such as construction dates, pavement structure details, maintenance and repair history, and pavement distress surveys. These data were used to draw conclusions about the impact of treatment applications, climatic and geologic factors, traffic volume, and pavement structures on pavement performance. Gaps in knowledge about pavement failure modes, distress data, and effectiveness of treatment applications mentioned in the contracts database file hampered efforts to form a complete picture of the effectiveness of treatment options and their timely (or untimely) application. Similarly, details about pavement mixture design and differentiating factors between companion sites prevented researchers from narrowing down the causes leading to the observed pavement distress.
7
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), September 2011. http://dx.doi.org/10.2172/1024284.
Повний текст джерела
8
Qi, Fei, Zhaohui Xia, Gaoyang Tang, Hang Yang, Yu Song, Guangrui Qian, Xiong An, Chunhuan Lin, and Guangming Shi. A Graph-based Evolutionary Algorithm for Automated Machine Learning. Web of Open Science, December 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 the workflow of machine learning. On the PMLB dataset, the proposed approach shows the state-of-the-art performance compared with TPOT, Autostacker, and auto-sklearn. Some of the optimized models are with complex structures which are difficult to obtain in manual design.
9
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.
10
Aguilera-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, May 2011. http://dx.doi.org/10.32468/dtseru.144.
Повний текст джерела