Relevant bibliographies by topics / Connectivité des graphes

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Connectivité des graphes'

Author: Grafiati
Published: 26 July 2024
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Connectivité des graphes.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Connectivité des graphes"

1

THIERRY, Chloé, and Laure SANTONI. "Prise en compte des réseaux écologiques par les entreprises grâce à la modélisation de la connectivité avec Graphab." Sciences Eaux & Territoires, no. 46 (October 29, 2024): 8110. http://dx.doi.org/10.20870/revue-set.2024.46.8110.

Full text
Abstract:
La fragmentation et la destruction des habitats naturels résultant des activités humaines jouent un rôle majeur dans le déclin de la biodiversité. Restaurer les continuités écologiques est un bon moyen d’action pour limiter ces impacts, et les entreprises, gestionnaires de foncier, sont concernées par ces enjeux. Cet article expose les choix méthodologiques à effectuer lors des différentes étapes de la modélisation de la connectivité par la théorie des graphes (avec le logiciel Graphab) ainsi que différents contextes d’utilisations de celle-ci pour des sites d’entreprises. La modélisation de l
APA, Harvard, Vancouver, ISO, and other styles
2

BONCOURT, Étienne, André EVETTE, Laurent BERGÈS, and Maria ALP. "Le génie végétal au secours de la connectivité écologique des berges de cours d’eau." Sciences Eaux & Territoires, no. 46 (November 12, 2024): 8072. http://dx.doi.org/10.20870/revue-set.2024.46.8072.

Full text
Abstract:
Dans les zones urbanisées, les rivières et les écosystèmes riverains sont souvent les seuls corridors écologiques disponibles pour le déplacement de la faune. Cependant, les berges y sont souvent stabilisées par des ouvrages de génie civil, ce qui peut entraîner une dégradation de l'habitat et une perte de connectivité de ces habitats à l'échelle du paysage. Les ouvrages de génie végétal sont une alternative aux enrochements, car ils maintiennent la qualité des écosystèmes naturels en utilisant des espèces végétales indigènes au lieu de rochers, mais leur impact positif potentiel sur les mouve
APA, Harvard, Vancouver, ISO, and other styles
3

CLAUZEL, Céline, Christophe EGGERT, Simon TARABON, et al. "Analyser la connectivité de la trame turquoise : définition, caractérisation et enjeux opérationnels." Sciences Eaux & Territoires, no. 43 (October 16, 2023): 67–71. http://dx.doi.org/10.20870/revue-set.2023.43.7642.

Full text
Abstract:
Revue Sciences Eaux & Territoires - Vient de paraître en ligneLa fragmentation du paysage se matérialise par une rupture de connexion au sein des réseaux écologiques. Le concept de trame verte et bleue est apparu comme un outil de protection et de restauration des continuités écologiques dans les territoires. De nouvelles trames écologiques ont récemment été proposées pour identifier d’autres discontinuités écologiques effectives. C’est notamment le cas de la trame turquoise associant la trame bleue et la partie de la trame verte en interaction fonctionnelle. La trame turquoise regroupe ai
APA, Harvard, Vancouver, ISO, and other styles
4

Durand-Dubief, Françoise, Gabriel Kocevar, Claudio Stamile, Salem Hannoun, François Cotton, and 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 (March 2017): S124. http://dx.doi.org/10.1016/j.neurol.2017.01.216.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chawki, M. B., A. Verger, E. Klesse, et al. "É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 (2018): 137. http://dx.doi.org/10.1016/j.mednuc.2018.03.015.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Prajapati, Rajeshri, Amit Parikh, and 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 (2023): 1515–19. http://dx.doi.org/10.21275/sr231120155230.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Manickam, Machasri, and Kalyani Desikan. "Relationship Between the Second Largest Adjacency and Signless Laplacian Eigenvalues of Graphs and Properties of Planar Graphs." European Journal of Pure and Applied Mathematics 17, no. 4 (2024): 3004–21. https://doi.org/10.29020/nybg.ejpam.v17i4.5364.

Full text
Abstract:
A graph’s second largest eigenvalue is a significant algebraic characteristic that provides details on the graph’s expansion, connectivity, and randomness. Bounds for the second largest eigenvalue of a graph, denoted as λ2 were previously established in the literature in relation to graph parameters like edge connectivity and vertex connectivity, matching number, independencenumber, and edge expansion constant, among others. A graph is planar if it can be drawn in a plane without graph edges crossing. Determining the planarity of a graph helps in optimizing, simplifying, and understanding comp
APA, Harvard, Vancouver, ISO, and other styles
8

Kulli, V. R. "ATOM BOND CONNECTIVITY E-BANHATTI INDICES." INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH 11, no. 01 (2023): 3201–8. http://dx.doi.org/10.47191/ijmcr/v11i1.13.

Full text
Abstract:
In this paper, we introduce the atom bond connectivity E-Banhatti index and the sum atom bond connectivity E-Banhatti index of a graph. Also we compute these newly defined atom bond connectivity E-Banhatti indices for wheel graphs, friendship graphs, chain silicate networks, honeycomb networks and nanotubes.
APA, Harvard, Vancouver, ISO, and other styles
9

Mehmet, Şerif Aldemir, Ediz Süleyman, Çiftçi İdris, Yamaç Kerem, and Taş Ziyattin. "Domination edge connectivity of graphs." Graphs and Linear Algebra, no. 2 (September 23, 2023): 1–10. https://doi.org/10.5281/zenodo.8372637.

Full text
Abstract:
Domination and connectivity are two independent subjects of graph theory which have many applications in computer and information sciences. To bring these two terms together, we first define a novel conditional connectivity measure: k-domination edge connectivity.   In this study we compute k-domination edge connectivity of paths, cycles and complete graphs.
APA, Harvard, Vancouver, ISO, and other styles
10

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Connectivité des graphes"

1

Kang, Haiyan. "Arêtes suppressibles, cycles et connectivité." Paris 11, 2010. http://www.theses.fr/2010PA112060.

Full text
Abstract:
Soit G un graphe k-connexe et e = uv une arête de G. G/e nous noterons le graphe obtenu à partir de G en supprimant les sommets u, v et en ajoutant un nouveau sommet v_e tels que v_e est adjacent à tous les anciens voisins de u et v. Si G/e est encore k-connexe, e est appelé un bord de k-contractile. La première partie de la thèse étudie une propriété d'un bord contractile en k-connexe graphiques sans triangle. Soit G un graphe k-connexe, et soit e une arête de G. Soit GӨe désigner le graphe obtenu à partir de G par l'opération suivante: (1) supprimer e de G pour obtenir G-e; (2) pour tout som
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
In this thesis, we focus on the following topics: supereulerian graphs, hamiltonian line graphs, fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees, and several extremal problems on the (minimum and/or maximum) size of graphs under a given graph property. The thesis includes six chapters. The first one is to introduce definitions and summary the main results of the thesis, and in the last chapter we introduce the furture research of the thesis. The main studies in Chapters 2 - 5 are as follows. In Chapter 2, we explore conditions for a graph to be supereul
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
Abstract:
L'objectif principal de cette thèse est d'explorer la connectivité cérébrale et celle des réseaux de neurones artificiels d'un point de vue de leur connectivité. Un modèle par graphes pour l'analyse de la connectivité structurelle et fonctionnelle a été largement étudié dans le contexte du cerveau humain mais, un tel cadre d'analyse manque encore pour l'analyse des systèmes artificiels. Avec l'objectif d'intégrer l'analyse de la connectivité dans les système artificiels, cette recherche se concentre sur deux axes principaux. Dans le premier axe, l'objectif principal est de déterminer une carac
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
L'idée que l'intelligence s’appuie non seulement sur des régions spécifiques du cerveau, mais également sur des réseaux cérébraux efficaces s’est récemment affirmée. En effet, on pense que l'organisation du cerveau humain repose sur des réseaux complexes et dynamiques dans lesquels la communication entre les régions cérébrales garantit un transfert efficace d'informations. Ces concepts nous ont amené à explorer les bases neurales de l'intelligence en combinant des techniques avancées d'IRM et la théorie des graphes. D'un côté, les techniques avancées d'IRM, telles que l'IRM fonctionnelle au re
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
Abstract:
La décomposition des graphes fait référence au processus de décomposer un graphe complexe en composantes plus simples et plus petites, souvent dans le but d'analyser ou de résoudre des problèmes liés au graphe. Il s'agit d'un outil important pour représenter la structure globale et les propriétés d'une manière plus détaillée. Il est aussi également utile pour résoudre des problèmes impliquant la recherche de structures spécifiques dans un graphe. Il existe plusieurs types courants de techniques de décomposition de graphe largement utilisées en théorie des graphes et dans des domaines connexes,
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
Abstract:
L’imagerie par résonance magnétique fonctionnelle permet d’explorer l’activité neuronale en utilisant un contraste endogène appelé BOLD. Il a été montré que les fluctuations du signal BOLD au repos corrélaient dans des régions cérébrales distantes. C’est la connectivité fonctionnelle. Elle représente l’activité spontanée du cerveau et elle est mesurée par l’IRMf au repos. Notre projet de recherche a donc combiné un aspect méthodologique et deux applications dans le domaine des pathologies du mouvement. Nous avons étudié les stratégies de prétraitement des données. L'objectif était d'étudier l'
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
Abstract:
Ce travail doctoral s’inscrit dans le champ de la recherche translationnelle. Nous avonsvoulu explorer la plasticité cérébrale post-lésionnelle qui sous-tend la restauration de la conscience après un coma traumatique. L’étude de la connectivité fonctionnelle de repos, c’est à dire de la corrélation temporelle du signal BOLD (blood oxygenationlevel dependent) entre régions cérébrales, a été appliquée à une cohorte de 36 patients traumatisés crâniens graves sortant de réanimation. A cette date, les patients pouvaient se trouver en état de conscience altérée ou être conscients. Nous avons réalisé
APA, Harvard, Vancouver, ISO, and other styles
8

König, Jean-Claude. "Les réseaux d'interconnexion et les algorithmes distribués." Paris 11, 1987. http://www.theses.fr/1987PA112069.

Full text
Abstract:
Cette thèse comprend deux parties. La première concerne les réseaux d'interconnexion et en particulier leur résistance aux pannes. Le premier chapitre traite d'extension de réseaux; on construit des réseaux de connexité et de degré maximum donnés en ajoutant des sommets p par p par p ceci avec un nombre minimum de remaillages. Dans le second chapitre on étudie la vulnérabilité des réseaux par bus ce qui nous conduit à étudier diverses notions de connexité dans les hypergraphes uniformes. La deuxième partie est consacrée à l'algorithme, distribuée et particulièrement à tout ce qui concerne les
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
Abstract:
Le cerveau est un réseau complexe et nous savons que les mécanismes de synchronisation et de désynchronisation sont essentiels pour effectuer des taches motrices et cognitives. De nos jours, les interactions fonctionnelles cérébrales sont étudiées dans des applications d'interface cerveau-ordinateur (BCI) avec de plus en plus d'intérêt. Cela pourrait avoir un fort impact sur les systèmes BCI, généralement bases sur des caractéristiques univariées qui caractérisent séparément les activités régionales du cerveau. En effet, les fonctionnalités de connectivité cérébrale peuvent être utilisées pour
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Connectivité des graphes"

1

West, Douglas Brent. Introduction to graph theory. Prentice Hall, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Xueliang, and Yaping Mao. Generalized Connectivity of Graphs. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33828-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Xueliang, Colton Magnant, and Zhongmei Qin. Properly Colored Connectivity of Graphs. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89617-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Toshihide, Ibaraki, ed. Algorithmic aspects of graph connectivity. Cambridge University Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Nagamochi, Hiroshi. Algorithmic aspects of graph connectivity. Cambridge University Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Molitierno, Jason J. Applications of combinatorial matrix theory to Laplacian matrices of graphs. CRC Press, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Introduction to graph theory. 2nd ed. Prentice Hall, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs. CRC Press LLC, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Molitierno, Jason J. Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs. Taylor & Francis Group, 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Molitierno, Jason J. Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs. Taylor & Francis Group, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Connectivité des graphes"

1

Chartrand, Gary, Heather Jordon, Vincent Vatter, and Ping Zhang. "Connectivity." In Graphs & Digraphs, 7th ed. Chapman and Hall/CRC, 2023. http://dx.doi.org/10.1201/9781003461289-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jungnickel, Dieter. "Connectivity." In Graphs, Networks and Algorithms. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-662-03822-2_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Diestel, Reinhard. "Connectivity." In Graph Theory. Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-53622-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Diestel, Reinhard. "Connectivity." In Graph Theory. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-642-14279-6_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Aldous, Joan M., and Robin J. Wilson. "Paths and Connectivity." In Graphs and Applications. Springer London, 2000. http://dx.doi.org/10.1007/978-1-4471-0467-4_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Xueliang, Colton Magnant, and Zhongmei Qin. "Connectivity Conditions." In Properly Colored Connectivity of Graphs. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89617-5_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Xueliang, Colton Magnant, and Zhongmei Qin. "Directed Graphs." In Properly Colored Connectivity of Graphs. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89617-5_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Xueliang, Colton Magnant, and Zhongmei Qin. "Random Graphs." In Properly Colored Connectivity of Graphs. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89617-5_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Xueliang, and Yaping Mao. "Introduction." In Generalized Connectivity of Graphs. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33828-6_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Xueliang, and Yaping Mao. "Results for Some Graph Classes." In Generalized Connectivity of Graphs. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33828-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Connectivité des graphes"

1

Mijit, Asiya. "The generalized 3-connectivity of two kinds graphs." In 2025 5th International Conference on Applied Mathematics, Modelling and Intelligent Computing (CAMMIC 2025), edited by Peicheng Zhu and Guihua Lin. SPIE, 2025. https://doi.org/10.1117/12.3070779.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kurahashi, Masashi, Najd Salaani, Tsuyoshi Migita, and Norikazu Takahashi. "Depth-First Search Algorithms for Algebraic Connectivity Maximizing Regular Graphs." In 2024 Twelfth International Symposium on Computing and Networking (CANDAR). IEEE, 2024. https://doi.org/10.1109/candar64496.2024.00026.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Namouz, Essam Z., and Joshua D. Summers. "Comparison of Graph Generation Methods for Structural Complexity Based Assembly Time Estimation." In 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.

Full text
Abstract:
This paper compares two different methods of graph generation for input into the complexity connectivity method to estimate the assembly time of a product. The complexity connectivity method builds predictive models for assembly time based on twenty-nine complexity metrics applied to the product graphs. Previously the part connection graph was manually created, but recently the Assembly Mate Method and the Interference Detection Method have introduced new automated tools for creating the part connectivity graphs. These graph generation methods are compared on their ability to predict the assem
APA, Harvard, Vancouver, ISO, and other styles
4

Jongsma, T. J., and W. Zhang. "An Efficient Algorithm for Finding Optimum Code Under the Condition of Incident Degree." In ASME 1992 Design Technical Conferences. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/detc1992-0409.

Full text
Abstract:
Abstract This paper deals with the identification of kinematic chains. A kinematic chain can be represented by a weighed graph. The identification of kinematic chains is thereby transformed into the isomorphism problem of graph. When a computer program has to detect isomorphism between two graphs, the first step is to set up the corresponding connectivity matrices for each graph, which are adjacency matrices when considering adjacent vertices and the weighed edges between them. Because these adjacency matrices are dependent of the initial labelling, one can not conclude that the graphs differ
APA, Harvard, Vancouver, ISO, and other styles
5

Hahn, Elad, and Offer Shai. "The Unique Engineering Properties of Assur Groups/Graphs, Assur Kinematic Chains, Baranov Trusses and Parallel Robots." In 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.

Full text
Abstract:
Modular topological structures, commonly known as Assur groups, have been an important subject of research in machine theory over the past several decades. In this paper, some unique engineering properties which appear in this type of structures and only in them are exposed. The concept of Assur groups is reformulated in terms of graphs and named Assur Graphs (AGs). The graph representation enables to present the inter-connectivity between all the elements of the AG, which is the fundamental characteristic from which all its unique properties derive. This inter-connectivity leads to unique pro
APA, Harvard, Vancouver, ISO, and other styles
6

Jafarpour, Maryam, Mohammad Shekaramiz, Abolfazl Javan, and Ali Moeini. "Building Graphs with Maximum Connectivity." In 2020 Intermountain Engineering, Technology and Computing (IETC). IEEE, 2020. http://dx.doi.org/10.1109/ietc47856.2020.9249130.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hooshmand, Amir, and Matthew I. Campbell. "Tensegrity Form-Finding Using Generative Design Synthesis Approach." In 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.

Full text
Abstract:
The aim of this research is to produce large irregular tensegrity structures using a generative design synthesis approach. Unlike most of the form-finding methods, the approach does not require the description of the connectivity of the tensegrity structures to define the shape of the tensegrities. It uses graphs to represent the tensegrity structures, which allows a very fast generation of stable tensegrity solutions for a given design problem. The graph grammar interpreter, GraphSynth, is used to carry out graph transformations, which define different configurations for a given design proble
APA, Harvard, Vancouver, ISO, and other styles
8

Duarte Jr., Elias Procópio, and Andréa Weber. "Simulation of a Distributed Connectivity Algorithm for General Topology Networks." In Workshop de Testes e Tolerância a Falhas. Sociedade Brasileira de Computação - SBC, 2002. http://dx.doi.org/10.5753/wtf.2002.23409.

Full text
Abstract:
The Distributed Network Connectivity algorithm allows every node in a general topology network to determine to which portions of the network it is connected, and which portions are unreachable. The algorithm consists of three phases: test, dissemination, and connectivity computation. During the testing phase each fault-free node tests all its neighbors at each testing interval. Upon the detection of a new fault event, the tester starts the dissemination phase, in which a reliable broadcast algorithm is employed to inform the other connected nodes about the event. At any time, any working node
APA, Harvard, Vancouver, ISO, and other styles
9

You, Lantao, Yuejuan Han, Xi Wang, Chen Zhou, Rui Gu, and Chen Lu. "Structure Connectivity and Substructure Connectivity of Alternating Group Graphs." In 2018 IEEE International Conference on Progress in Informatics and Computing (PIC). IEEE, 2018. http://dx.doi.org/10.1109/pic.2018.8706296.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Charrier, Tristan, Arthur Queffelec, Ocan Sankur, and François Schwarzentruber. "Reachability and Coverage Planning for Connected Agents." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/21.

Full text
Abstract:
Motivated by the increasing appeal of robots in information-gathering missions, we study multi-agent path planning problems in which the agents must remain interconnected. We model an area by a topological graph specifying the movement and the connectivity constraints of the agents. We study the theoretical complexity of the reachability and the coverage problems of a fleet of connected agents on various classes of topological graphs. We establish the complexity of these problems on known classes, and introduce a new class called sight-moveable graphs which admit efficient algorithms.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Connectivité des graphes"

1

Rodger, C. A., D. G. Hoffman, P. D. Johnson, and Jr. Connectivity and Colorings of Graphs. Defense Technical Information Center, 2002. http://dx.doi.org/10.21236/ada400177.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Feddema, John Todd, Raymond Harry Byrne, and Chaouki T. Abdallah. Algebraic connectivity and graph robustness. Office of Scientific and Technical Information (OSTI), 2009. http://dx.doi.org/10.2172/973665.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhao, Jun, Osman Yagan, and Virgil Gligor. Results on Vertex Degree and K-Connectivity in Uniform S-Intersection Graphs. Defense Technical Information Center, 2014. http://dx.doi.org/10.21236/ada609112.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

McGlaughlin, Alec S. Analyzing and Assessing Brain Structure with Graph Connectivity Measures. Defense Technical Information Center, 2014. http://dx.doi.org/10.21236/ada604781.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Nieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 18. Hilbert Press, 2018. http://dx.doi.org/10.56441/hilbertpress.1818.9585.

Full text
Abstract:
CONN is a Matlab-based cross-platform software for the computation, display, and analysis of functional connectivity in fMRI (fcMRI). Connectivity measures include seed-to-voxel connectivity maps, ROI-to- ROI connectivity matrices, graph properties of connectivity networks, generalized psychophysiological interaction models (gPPI), intrinsic connectivity, local correlation and other voxel-to-voxel measures, independent component analyses (ICA), and dynamic component analyses (dyn-ICA). CONN is available for resting state data (rsfMRI) as well as task-related designs. It covers the entire pipel
APA, Harvard, Vancouver, ISO, and other styles
6

Nieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 20. Hilbert Press, 2020. http://dx.doi.org/10.56441/hilbertpress.2048.3738.

Full text
Abstract:
CONN is a Matlab-based cross-platform software for the computation, display, and analysis of functional connectivity in fMRI (fcMRI). Connectivity measures include seed-to-voxel connectivity maps, ROI-to- ROI connectivity matrices, graph properties of connectivity networks, generalized psychophysiological interaction models (gPPI), intrinsic connectivity, local correlation and other voxel-to-voxel measures, independent component analyses (ICA), and dynamic component analyses (dyn-ICA). CONN is available for resting state data (rsfMRI) as well as task-related designs. It covers the entire pipel
APA, Harvard, Vancouver, ISO, and other styles
7

Nieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 19. Hilbert Press, 2019. http://dx.doi.org/10.56441/hilbertpress.1927.9364.

Full text
Abstract:
CONN is a Matlab-based cross-platform software for the computation, display, and analysis of functional connectivity in fMRI (fcMRI). Connectivity measures include seed-to-voxel connectivity maps, ROI-to- ROI connectivity matrices, graph properties of connectivity networks, generalized psychophysiological interaction models (gPPI), intrinsic connectivity, local correlation and other voxel-to-voxel measures, independent component analyses (ICA), and dynamic component analyses (dyn-ICA). CONN is available for resting state data (rsfMRI) as well as task-related designs. It covers the entire pipel
APA, Harvard, Vancouver, ISO, and other styles
8

Han, Guang, and Armand M. Makowski. A Strong Zero-One Law for Connectivity in One-Dimensional Geometric Random Graphs With Non-Vanishing Densities. Defense Technical Information Center, 2007. http://dx.doi.org/10.21236/ada468079.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sparrow, Kent, Joseph Gutenson, Mark Wahl, and 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.), 2022. http://dx.doi.org/10.21079/11681/45484.

Full text
Abstract:
Short-term climatic and hydrologic interactions, or hydroclimatology, are an important consideration when delineating the geographic extent of aquatic resources and assessing whether an aquatic resource is a jurisdictional water of the United States (WOTUS) and is therefore subject to the Clean Water Act (CWA). The now vacated 2020 Navigable Waters Protection Rule (NWPR) required the evaluation of precipitation and other hydroclimatic conditions to assess the jurisdictional status of an aquatic resource based on normal hydroclimatic conditions. Short-term hydroclimatic conditions, such as ante
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Connectivité des graphes' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography