Littérature scientifique sur le sujet « Connectivité des graphes »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Connectivité des graphes ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Connectivité des graphes"
CLAUZEL, Céline, Christophe EGGERT, Simon TARABON, Lili PASQUET, Gilles VUIDEL, Marion BAILLEUL, Claude MIAUD et Claire GODET. « Analyser la connectivité de la trame turquoise : définition, caractérisation et enjeux opérationnels ». Sciences Eaux & ; Territoires, no 43 (16 octobre 2023) : 67–71. http://dx.doi.org/10.20870/revue-set.2023.43.7642.
Texte intégralDurand-Dubief, Françoise, Gabriel Kocevar, Claudio Stamile, Salem Hannoun, François Cotton et Dominique Sappey-Marinier. « Analyse de la connectivité structurelle cérébrale par la théorie des graphes : une nouvelle caractérisation des formes cliniques de sclérose en plaques ». Revue Neurologique 173 (mars 2017) : S124. http://dx.doi.org/10.1016/j.neurol.2017.01.216.
Texte intégralChawki, M. B., A. Verger, E. Klesse, T. Witjas, J. P. Azulay, A. Eusebio et E. Guedj. « Étude TEP cérébrale des troubles du contrôle des impulsions dans la maladie de Parkinson : approche de la connectivité métabolique par théorie des graphes ». Médecine Nucléaire 42, no 3 (mai 2018) : 137. http://dx.doi.org/10.1016/j.mednuc.2018.03.015.
Texte intégralPrajapati, Rajeshri, Amit Parikh et Pradeep Jha. « Exploring Novel Edge Connectivity in Graph Theory and its Impact on Eulerian Line Graphs ». International Journal of Science and Research (IJSR) 12, no 11 (5 novembre 2023) : 1515–19. http://dx.doi.org/10.21275/sr231120155230.
Texte intégralKulli, V. R. « ATOM BOND CONNECTIVITY E-BANHATTI INDICES ». INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH 11, no 01 (30 janvier 2023) : 3201–8. http://dx.doi.org/10.47191/ijmcr/v11i1.13.
Texte intégralZhao, Kewen. « A simple proof of Whitney's Theorem on connectivity in graphs ». Mathematica Bohemica 136, no 1 (2011) : 25–26. http://dx.doi.org/10.21136/mb.2011.141446.
Texte intégralBoronina, Anna, Vladimir Maksimenko et Alexander E. Hramov. « Convolutional Neural Network Outperforms Graph Neural Network on the Spatially Variant Graph Data ». Mathematics 11, no 11 (30 mai 2023) : 2515. http://dx.doi.org/10.3390/math11112515.
Texte intégralYalaniak Supriya Butte, Ashwini. « Neighbour Degree Connectivity Indices of Graphs and Its Applications to the Octane Isomers ». International Journal of Science and Research (IJSR) 12, no 4 (5 avril 2023) : 1892–96. http://dx.doi.org/10.21275/sr23716144709.
Texte intégralJiang, Huiqin, et Yongsheng Rao. « Connectivity Index in Vague Graphs with Application in Construction ». Discrete Dynamics in Nature and Society 2022 (15 février 2022) : 1–15. http://dx.doi.org/10.1155/2022/9082693.
Texte intégralOellermann, Ortrud R. « Major n-connected graphs ». Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 47, no 1 (août 1989) : 43–52. http://dx.doi.org/10.1017/s1446788700031189.
Texte intégralThèses sur le sujet "Connectivité des graphes"
Kang, Haiyan. « Arêtes suppressibles, cycles et connectivité ». Paris 11, 2010. http://www.theses.fr/2010PA112060.
Texte intégralLet G be a k-connected graph and e=uv an edge of G. By G/e we denote the graph obtained from G by deleting the vertices u,v and adding a new vertex v_e such that v_e is adjacent to all the former neighbors of u and v. If G/e is still k-connected, then e is called a k-contractible edge. The first part of the thesis studies a property of a contractible edge in k-connected triangle-free graphs. Let G be a k-connected graph, and let e be an edge of G. Let GӨe denote the graph obtained from G by the following operation: (1) delete e from G to get G-e; (2) for any end vertex of e with degree k-1, say x, delete x, and then add edges between any pair of non-adjacent vertices in N_{G-e}(x). If GӨe is k-connected, then e is said to be a removable edge of G. The second part of the thesis investigates the distribution of removable edges in 3-connected graphs or 5-connected graphs. In addition, we confirm Thomassen’s conjecture for two classes of 3-connected graphs with bounds of removable edges on or off a longest cycle. The last part of the thesis is devoted to the prism cyclability of graphs. The prism over a graph G is the Cartesian product GK_2 of G with the complete graph K_2. G is said to be prism hamiltonian if GK_2 is hamiltonian. We say that a set H V(G) of vertices is cyclable in G if there is a cycle C in G containing all vertices of H. For H V(G), we say that H is prism cyclable in GK_2 if H∪H' where H' is the copy of H is cyclable in GK_2. We extend Ozeki’s result on prism hamiltonicity to prism cyclability of S. It is also argued for claw-free graphs, the bound can be reduced 3 with one expection
Yang, Weihua. « Supereulerian graphs, Hamiltonicity of graphes and several extremal problems in graphs ». Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00877793.
Texte intégralCarboni, Lucrezia. « Graphes pour l’exploration des réseaux de neurones artificiels et de la connectivité cérébrale humaine ». Electronic Thesis or Diss., Université Grenoble Alpes, 2023. http://www.theses.fr/2023GRALM060.
Texte intégralThe main objective of this thesis is to explore brain and artificial neural network connectivity from agraph-based perspective. While structural and functional connectivity analysis has been extensivelystudied in the context of the human brain, there is a lack of a similar analysis framework in artificialsystems.To address this gap, this research focuses on two main axes.In the first axis, the main objective is to determine a healthy signature characterization of the humanbrain resting state functional connectivity. To achieve this objective, a novel framework is proposed,integrating traditional graph statistics and network reduction tools, to determine healthy connectivitypatterns. Hence, we build a graph pair-wise comparison and a classifier to identify pathological statesand rank associated perturbed brain regions. Additionally, the generalization and robustness of theproposed framework were investigated across multiple datasets and variations in data quality.The second research axis explores the benefits of brain-inspired connectivity exploration of artificialneural networks (ANNs) in the future perspective of more robust artificial systems development. Amajor robustness issue in ANN models is represented by catastrophic forgetting when the networkdramatically forgets previously learned tasks when adapting to new ones. Our work demonstrates thatgraph modeling offers a simple and elegant framework for investigating ANNs, comparing differentlearning strategies, and detecting deleterious behaviors such as catastrophic forgetting.Moreover, we explore the potential of leveraging graph-based insights to effectively mitigatecatastrophic forgetting, laying a foundation for future research and explorations in this area
Suprano, Ilaria. « Étude de la connectivité cérébrale par IRM fonctionnelle et de diffusion dans l’intelligence ». Thesis, Lyon, 2019. http://www.theses.fr/2019LYSE1282.
Texte intégralThe idea that intelligence is embedded not only in specific brain regions, but also in efficient brain networks has grown up. Indeed, human brain organization is believed to rely on complex and dynamic networks in which the communication between cerebral regions guarantees an efficient transfer of information. These recent concepts have led us to explore the neural bases of intelligence using both advanced MRI techniques in combination with graph analysis. On one hand, advanced MRI techniques, such as resting-state functional MRI (rs-fMRI) and diffusion MRI (dMRI) allow the exploration of respectively the functional and the structural brain connectivity while on the other hand, graph theory models allow the characterization of brain networks properties at different scales, thanks to global and local metrics. The aim of this thesis is to characterize the topology of functional and structural brain networks in children and in adults with an intelligence quotient higher (HIQ) than standard levels (SIQ). First, we focused our attention on a children population with different cognitive characteristics. Two HIQ profiles, namely homogeneous (Hom-HIQ) and heterogeneous HIQ (Het-HIQ), have been defined based on clinical observations and Intelligence Quotient (IQ) sub-tests. Using resting-state fMRI techniques, we examined the functional network topology changes, estimating the "hub disruption index", in these two HIQ profiles. We found significant topological differences in the integration and segregation properties of brain networks in HIQ compared to SIQ children, for the whole brain graph, for each hemispheric graph, and for the homotopic connectivity. These brain networks changes resulted to be more pronounced in Het-HIQ subgroup. Finally, we found significant correlations between the graph networks’ changes and the full-scale IQ, as well as some intelligence subscales. These results demonstrated for the first time, that different HIQ profiles are related to a different neural substrate organization. Then, the structural brain network connectivity, measured by dMRI in all HIQ children, were significantly different than in SIQ children. Also, we found strong correlations between the children brain networks density and their intelligence scores. Furthermore, several correlations were found between integration graph metrics suggesting that intelligence performances are probably related to a homogeneous network organization. These findings demonstrated that intelligence neural substrate is based on a strong white matter microarchitecture of the major fiber-bundles and a well-balanced network organization between local and global scales. This children population was finally studied using a memory-word task of fMRI. Significant changes were observed between both HIQ and SIQ groups. This study confirms our hypothesis that both HIQ profiles are characterized by a different brain activity, with stronger evidences in Het-HIQ children. Finally, we investigated both functional and structural connectivity in a population of adults HIQ. We found several correlations between graph metrics and intelligence sub-scores. As well as for the children population, high cognitive abilities of adults seem to be related brain structural and functional networks organization with a decreased modularity. In conclusion, the sensitivity of graph metrics based on advanced MRI techniques, such as rs-fMRI and dMRI, was demonstrated to be very helpful to provide a better characterization of children and adult HIQ, and further, to distinguish different intelligence profiles in children
Dai, Tianjiao. « Some vertex colouring problems and a generalisation of Hamilton-connectivity in graphs ». Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG067.
Texte intégralThe decomposition of graphs refers to the process of breaking down a complex graph into simpler, smaller components, often with the goal of analysing or solving problems related to the graph. It is an important tool to display the global structure and properties in a more fine-grained manner, and also useful in solving problems that involve finding specific structures in a graph. There are several common types of graph decomposition techniques that are widely used in graph theory and related fields, including tree decomposition, block decomposition, modular decomposition, hierarchical decomposition, etc. This thesis studies two kinds of vertex decomposition of a graph: proper colourings (decomposition into independent sets) and Hamilton-connectivity (decomposition into internally-disjoint paths between two sets where the paths cover all the vertices of graphs)
Gargouri, Fatma. « Etude de la connectivité fonctionnelle dans les pathologies de mouvement de Parkinson et de Huntington en utilisant l’approche par graine et la théorie des graphes ». Thesis, Paris 6, 2017. http://www.theses.fr/2017PA066487/document.
Texte intégralFunctional magnetic resonance imaging (fMRI) is a technique that allows exploring neuronal activity using an endogenous contrast based on the oxygenation level of hemoglobin. This contrast is called BOLD (Blood oxygenated Level Dependent). It has been shown that fluctuations in the BOLD signal at rest, correlated in distant brain regions, defining long-distance brain functional networks. This is called functional connectivity. The latter represents the spontaneous activity of the brain and it is measured by fMRI at rest. Our research project has therefore combined a methodological aspect and two applications in the field of movement pathologies. In the first part of our project we studied data preprocessing strategies. The objective was to study the influence of the preprocessing steps and their order of application on the brain networks’ topology. We compared 12 different pretreatment strategies. In these strategies we applied the standard and most used techniques but with a different order of application. The following two studies used resting-state fMRI to study: Huntington's disease and Parkinson's disease. In these pathologies, we focused on the study of the brain networks addressed through the study of functional connectivity. We determined whether resting-state fMRI and graph theory measures were able to identify robust biomarkers of Huntington's disease progression in a longitudinal study. In the second study, we investigated the role of cholinergic basal nuclei of the forebrain and their connections in the onset of cognitive problems presented in Parkinson's disease. The seed-based analysis is a suitable method for this type of question
Oujamaa, Lydia. « Evolution topologique des hubs dans l'état de conscience altérée post-traumatique : un marqueur de récupération fonctionnelle ». Thesis, Université Grenoble Alpes, 2020. http://www.theses.fr/2020GRALS013.
Texte intégralThis work takes part in the field of translational research. Our aim was to explore thepost-lesional brain plasticity necessary to recover consciousness after a traumatic coma.The study of resting state functional connectivity, meaning the temporal correlation ofBOLD signal (blood oxygenation level dependent) between remote cerebral areas, wasapplied to severe traumatic brain injured (sTBI) patients.Using graph method, we explored the diagnosis and prognosis value of resting statefunctional connectivity during recovery of consciousness after a traumatic coma.Thirty six sTBI patients were studied in a cross sectional and a longitudinal design.We recorded a resting state functional MRI sequence while sTBI patients were eitherconscious or in altered state of consciousness when discharged from intensive care unit(ICU). A second fMRI was recorded after one month spent in a post-ICU rehabilitationunit.Our analysis focused on a hub disruption index (HDI) which expresses the reallocationof functional connections inside the graph. In the brain network, the hubs, which are definedas highly connected to the brain network in healthy subjects, have been characterizedwith integration, segregation and centrality metrics for information transfer.Our results suggest that the topological disruption of functional hubs is an objectivemapping of the brain network changes that correlates with post-TBI neurological recovery.Indeed, in our group analysis, the hub disruption index of the post TBI brainnetwork was sensitive to the state of consciousness and to its recovery during a onemonth follow-up. This index was also relevant to predict the level of disability 6 monthsafter injury.The computation of connectivity data in a metadata, the hub disruption index ofthe brain network, enhances the classical approach describing the post-traumatic brainplasticity as a loss and recovery of connectivity in one or several cortical networks. Therecovery of the brain network ability to compute local information in the functionalhubs could be necessary to recover consciousness after a traumatic coma. This resultis original as the recent litterature, based on the information integration theory andthe global workspace theory of consciousness, is considering severe TBI as a long rangeconnectivity disruption inducing a functional integration impairment.This pilot study was necessary prior to the assessment of the HDI on a single-subjectlevel and to quantifie the response of brain injured patients with disorder of consciousnessto several therapeutic options (psychostimulant drugs, electrical stimulation..)
König, Jean-Claude. « Les réseaux d'interconnexion et les algorithmes distribués ». Paris 11, 1987. http://www.theses.fr/1987PA112069.
Texte intégralThis thesis contains two parts. Ln the first one we study interconnection networks and in particular their fault tolerance. The first chapter deals with the extensions of networks. We construct networks with given connectivity and maximum degree by adding the vertices p by p. In such a way that the minimum number possible of links is deleted. Ln chapter 2 we study the vulnerability of bus networks; this leads us to study various notions of connectivity in uniform hypergraphs. The second part concerns distributed algorithms, in particular problems of broadcasting and routing. Chapter 3 deals with the problem of broadcasting information or requests in a distributed net work. We give a new algorithm to construct a spanning tree and apply it to the problem of mutual exclusion. We use methods of control knowledge transfers and also synchronization and filtering methods. Ln chapter 4 we present a "meta-algorithm" based on the notion of phases. Furthermore we specify the use and the importance of the network topology in the distributed computing. Ln these two chapters we determine the complexity in number or messages and time of the proposed algorithms. Finally we give in the appendix a scheduling algorithm for parallel computing which is optimal for the 2-sceps precedence graph (Gaussian elimination in dense matrices)
Cattai, Tiziana. « Leveraging brain connectivity networks to detect mental states during motor imagery ». Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS081.
Texte intégralThe brain is a complex network and we know that inter-areal synchronization and de-synchronization mechanisms are crucial to perform motor and cognitive tasks. Nowadays, brain functional interactions are studied in brain-computer interface BCI) applications with more and more interest. This might have strong impact on BCI systems, typically based on univariate features which separately characterize brain regional activities. Indeed, brain connectivity features can be used to develop alternative BCIs in an effort to improve performance and to extend their real-life applicability. The ambition of this thesis is the investigation of brain functional connectivity networks during motor imagery (MI)-based BCI tasks. It aims to identify complex brain functioning, re-organization processes and time-varying dynamics, at both group and individual level. This thesis presents different developments that sequentially enrich an initially simple model in order to obtain a robust method for the study of functional connectivity networks. Experimental results on simulated and real EEG data recorded during BCI tasks prove that our proposed method well explains the variegate behaviour of brain EEG data. Specifically, it provides a characterization of brain functional mechanisms at group level, together with a measure of the separability of mental conditions at individual level. We also present a graph denoising procedure to filter data which simultaneously preserve the graph connectivity structure and enhance the signal-to-noise ratio. Since the use of a BCI system requires a dynamic interaction between user and machine, we finally propose a method to capture the evolution of time-varying data. In essence, this thesis presents a novel framework to grasp the complexity of graph functional connectivity during cognitive tasks
Termenon, Conde Maite. « Analyse par graphes de la connectivité fonctionnelle de repos par IRM : vers de nouveaux biomarqueurs de la récupération fonctionnelle dans l'AVC ». Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAS023/document.
Texte intégralLivres sur le sujet "Connectivité des graphes"
West, Douglas Brent. Introduction to graph theory. Upper Saddle River, NJ : Prentice Hall, 1996.
Trouver le texte intégralLi, Xueliang, et Yaping Mao. Generalized Connectivity of Graphs. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33828-6.
Texte intégralLi, Xueliang, Colton Magnant et Zhongmei Qin. Properly Colored Connectivity of Graphs. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89617-5.
Texte intégralNagamochi, Hiroshi. Algorithmic aspects of graph connectivity. New York : Cambridge University Press, 2008.
Trouver le texte intégralToshihide, Ibaraki, dir. Algorithmic aspects of graph connectivity. New York : Cambridge University Press, 2008.
Trouver le texte intégralMolitierno, Jason J. Applications of combinatorial matrix theory to Laplacian matrices of graphs. Boca Raton : CRC Press, 2012.
Trouver le texte intégralMolitierno, Jason J. Applications of combinatorial matrix theory to Laplacian matrices of graphs. Boca Raton : CRC Press, 2012.
Trouver le texte intégralIntroduction to graph theory. 2e éd. Upper Saddle River, N.J : Prentice Hall, 2001.
Trouver le texte intégralMolitierno, Jason J. Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs. Taylor & Francis Group, 2016.
Trouver le texte intégralMolitierno, Jason J. Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs. Taylor & Francis Group, 2012.
Trouver le texte intégralChapitres de livres sur le sujet "Connectivité des graphes"
Chartrand, Gary, Heather Jordon, Vincent Vatter et Ping Zhang. « Connectivity ». Dans Graphs & ; Digraphs, 81–102. 7e éd. Boca Raton : Chapman and Hall/CRC, 2023. http://dx.doi.org/10.1201/9781003461289-4.
Texte intégralJungnickel, Dieter. « Connectivity ». Dans Graphs, Networks and Algorithms, 331–53. Berlin, Heidelberg : Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-662-03822-2_11.
Texte intégralDiestel, Reinhard. « Connectivity ». Dans Graph Theory, 59–87. Berlin, Heidelberg : Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-53622-3_3.
Texte intégralDiestel, Reinhard. « Connectivity ». Dans Graph Theory, 59–86. Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-642-14279-6_3.
Texte intégralAldous, Joan M., et Robin J. Wilson. « Paths and Connectivity ». Dans Graphs and Applications, 216–41. London : Springer London, 2000. http://dx.doi.org/10.1007/978-1-4471-0467-4_10.
Texte intégralLi, Xueliang, Colton Magnant et Zhongmei Qin. « Directed Graphs ». Dans Properly Colored Connectivity of Graphs, 97–102. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89617-5_10.
Texte intégralLi, Xueliang, Colton Magnant et Zhongmei Qin. « Random Graphs ». Dans Properly Colored Connectivity of Graphs, 63–72. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89617-5_7.
Texte intégralLi, Xueliang, Colton Magnant et Zhongmei Qin. « Connectivity Conditions ». Dans Properly Colored Connectivity of Graphs, 15–22. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89617-5_3.
Texte intégralLi, Xueliang, et Yaping Mao. « Introduction ». Dans Generalized Connectivity of Graphs, 1–13. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33828-6_1.
Texte intégralLi, Xueliang, et Yaping Mao. « Results for Some Graph Classes ». Dans Generalized Connectivity of Graphs, 15–29. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33828-6_2.
Texte intégralActes de conférences sur le sujet "Connectivité des graphes"
Namouz, Essam Z., et Joshua D. Summers. « Comparison of Graph Generation Methods for Structural Complexity Based Assembly Time Estimation ». Dans ASME 2013 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/detc2013-12300.
Texte intégralJongsma, T. J., et W. Zhang. « An Efficient Algorithm for Finding Optimum Code Under the Condition of Incident Degree ». Dans ASME 1992 Design Technical Conferences. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/detc1992-0409.
Texte intégralHahn, Elad, et Offer Shai. « The Unique Engineering Properties of Assur Groups/Graphs, Assur Kinematic Chains, Baranov Trusses and Parallel Robots ». Dans ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-59135.
Texte intégralDuarte Jr., Elias Procópio, et Andréa Weber. « Simulation of a Distributed Connectivity Algorithm for General Topology Networks ». Dans Workshop de Testes e Tolerância a Falhas. Sociedade Brasileira de Computação - SBC, 2002. http://dx.doi.org/10.5753/wtf.2002.23409.
Texte intégralHooshmand, Amir, et Matthew I. Campbell. « Tensegrity Form-Finding Using Generative Design Synthesis Approach ». Dans ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-47954.
Texte intégralJafarpour, Maryam, Mohammad Shekaramiz, Abolfazl Javan et Ali Moeini. « Building Graphs with Maximum Connectivity ». Dans 2020 Intermountain Engineering, Technology and Computing (IETC). IEEE, 2020. http://dx.doi.org/10.1109/ietc47856.2020.9249130.
Texte intégralCharrier, Tristan, Arthur Queffelec, Ocan Sankur et François Schwarzentruber. « Reachability and Coverage Planning for Connected Agents ». Dans 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/21.
Texte intégralYou, Lantao, Yuejuan Han, Xi Wang, Chen Zhou, Rui Gu et Chen Lu. « Structure Connectivity and Substructure Connectivity of Alternating Group Graphs ». Dans 2018 IEEE International Conference on Progress in Informatics and Computing (PIC). IEEE, 2018. http://dx.doi.org/10.1109/pic.2018.8706296.
Texte intégralBei, Xiaohui, Alexander Lam, Xinhang Lu et Warut Suksompong. « Welfare Loss in Connected Resource Allocation ». Dans 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/294.
Texte intégralZhuo, Wei, et Guang Tan. « Proximity Enhanced Graph Neural Networks with Channel Contrast ». Dans Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California : International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/340.
Texte intégralRapports d'organisations sur le sujet "Connectivité des graphes"
Rodger, C. A., D. G. Hoffman, P. D. Johnson et Jr. Connectivity and Colorings of Graphs. Fort Belvoir, VA : Defense Technical Information Center, mars 2002. http://dx.doi.org/10.21236/ada400177.
Texte intégralFeddema, John Todd, Raymond Harry Byrne et Chaouki T. Abdallah. Algebraic connectivity and graph robustness. Office of Scientific and Technical Information (OSTI), juillet 2009. http://dx.doi.org/10.2172/973665.
Texte intégralZhao, Jun, Osman Yagan et Virgil Gligor. Results on Vertex Degree and K-Connectivity in Uniform S-Intersection Graphs. Fort Belvoir, VA : Defense Technical Information Center, janvier 2014. http://dx.doi.org/10.21236/ada609112.
Texte intégralMcGlaughlin, Alec S. Analyzing and Assessing Brain Structure with Graph Connectivity Measures. Fort Belvoir, VA : Defense Technical Information Center, mai 2014. http://dx.doi.org/10.21236/ada604781.
Texte intégralNieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 18. Hilbert Press, 2018. http://dx.doi.org/10.56441/hilbertpress.1818.9585.
Texte intégralNieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 20. Hilbert Press, 2020. http://dx.doi.org/10.56441/hilbertpress.2048.3738.
Texte intégralNieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 19. Hilbert Press, 2019. http://dx.doi.org/10.56441/hilbertpress.1927.9364.
Texte intégralHan, Guang, et Armand M. Makowski. A Strong Zero-One Law for Connectivity in One-Dimensional Geometric Random Graphs With Non-Vanishing Densities. Fort Belvoir, VA : Defense Technical Information Center, avril 2007. http://dx.doi.org/10.21236/ada468079.
Texte intégralSparrow, Kent, Joseph Gutenson, Mark Wahl et Kayla Cotterman. Evaluation of climatic and hydroclimatic resources to support the US Army Corps of Engineers Regulatory Program. Engineer Research and Development Center (U.S.), septembre 2022. http://dx.doi.org/10.21079/11681/45484.
Texte intégral