Literatura académica sobre el tema "Théorie topologique des graphes"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Théorie topologique des graphes".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Théorie topologique des graphes"
Dalud-Vincent, Monique. "Une autre manière de modéliser les réseaux sociaux. Applications à l’étude de co-publications". Nouvelles perspectives en sciences sociales 12, n.º 2 (22 de agosto de 2017): 41–68. http://dx.doi.org/10.7202/1040904ar.
Texto completoTacnet, Jean-Marc, Elodie Forestier, Eric Mermet, Corinne Curt y Frédéric Berger. "Résilience territoriale : du concept à l'analyse d'infrastructures critiques en montagne". La Houille Blanche, n.º 5-6 (octubre de 2018): 20–28. http://dx.doi.org/10.1051/lhb/2018047.
Texto completoLemieux, Vincent. "L'articulation des réseaux sociaux". Recherches sociographiques 17, n.º 2 (12 de abril de 2005): 247–60. http://dx.doi.org/10.7202/055716ar.
Texto completoMazille, J. E. "Caractérisation de macrostructures par la théorie des graphes". Revue de Métallurgie 90, n.º 9 (septiembre de 1993): 1079. http://dx.doi.org/10.1051/metal/199390091079.
Texto completoDa Silva, Alban. "La théorie des graphes se révèle au Vanuatu". Pour la Science N° 550 – août, n.º 8 (1 de agosto de 2023): 22–33. http://dx.doi.org/10.3917/pls.550.0022.
Texto completoBailly, Sean. "La théorie des graphes, l’invitée surprise des soirées". Pour la Science N° 548 – juin, n.º 6 (1 de junio de 2023): 6–7. http://dx.doi.org/10.3917/pls.548.0006.
Texto completoFoucambert, Denis, Tracy Heranic, Christophe Leblay, Maarit Mutta y Minjing Zhong. "Intégration de la visualisation dans l’analyse de processus complexes : écritures et réécritures dans un corpus multilingue universitaire". SHS Web of Conferences 138 (2022): 06010. http://dx.doi.org/10.1051/shsconf/202213806010.
Texto completoMazille, J. E. "Analyse de structures complexes par la théorie des graphes". Revue de Métallurgie 91, n.º 2 (febrero de 1994): 223–32. http://dx.doi.org/10.1051/metal/199491020223.
Texto completoTAPIA, J. "K-théorie algébrique négative et K-théorie topologique de l'algèbre de fréchet des opérateurs régularisants". Annales Scientifiques de l’École Normale Supérieure 30, n.º 2 (1997): 241–77. http://dx.doi.org/10.1016/s0012-9593(97)89920-x.
Texto completoBrandt, Per Aage. "De la dynamique phrastique. Grammaire, chorématique et Théorie des Catastrophes". Estudos Semióticos 19, n.º 1 (27 de abril de 2023): 226–37. http://dx.doi.org/10.11606/issn.1980-4016.esse.2023.209341.
Texto completoTesis sobre el tema "Théorie topologique des graphes"
Delanoue, Nicolas. "Algorithmes numériques pour l'analyse topologique : Analyse par intervalles et théorie des graphes". Phd thesis, Université d'Angers, 2006. http://tel.archives-ouvertes.fr/tel-00340999.
Texto completoDe nombreux problèmes, comme l'étude de l'espace des configurations d'un robot, se ramènent à une étude qualitative d'ensembles. Ici, la ``taille'' de l'ensemble importe peu, ce qui compte, c'est sa ``topologie''. Les méthodes proposées calculent des invariants topologiques d'ensembles. Les ensembles considérés sont décrits à l'aide d'inégalités $\mathcal{C}^{\infty}$. L'idée maîtresse est de décomposer un ensemble donné en parties contractiles et d'utiliser l'homologie de \v Cech.
La seconde partie de la thèse concerne l'étude de point
asymptotiquement stables des systèmes dynamiques (linéaires ou non). Plus largement, on propose une méthode pour approcher le bassin d'attraction d'un point asymptotiquement stable. Dans un premier temps, on utilise la théorie de Lyapunov et le calcul par intervalle
pour trouver effectivement un voisinage inclus dans le bassin d'attraction d'un point prouvé asymptotiquement stable. Puis, on combine, une fois de plus, la théorie des graphes et les méthodes d'intégration d'équations différentielles ordinaires pour améliorer ce voisinage et ainsi construire un ensemble inclus dans le bassin
d'attraction de ce point.
Bellet, Thomas. "Transformations de graphes pour la modélisation géométrique à base topologique". Thesis, Poitiers, 2012. http://www.theses.fr/2012POIT2261/document.
Texto completoGeometric modeling is now involved in many fields such as: video games, architecture, engineering and archaeology. The represented objects are very different from one field to another, and so are their modeling operations. Furthermore, many specific types of modeling software are designed for high programing costs, but with a relatively low rate of effectiveness.The following is an alternative approach:– we have conceived a dedicated language for geometric modeling that will allow us to define any operation of any field; objects in this language are defined with the topological model of generalized maps, this definition has been extended to the embedding informations; here the operations are defined as graph transformation rules which originate from the category theory;– we have ensured operation definitions with consistency conditions; these operations that satisfy those conditions do not generate anomalies; – we have designed generic modeling software to serve as an interpreter of this language; the operation definitions are directly applied without the need for more programing; the software also automatically checks the language conditions and warns the user if he designs a non-consistent operation.The provided language and software prove to be efficient, and all for a low programing cost. Designing a new operation takes only minutes thanks to the language conditions, as opposed to hours of programming and debugging with the past approach
Colin, Fabrice. "Applications de la topologie algébrique en théorie des graphes". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1996. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq21733.pdf.
Texto completoDussaux, Valere. "Spécifications partielles de dessin de graphe : Étude logique et combinatoire". Bordeaux 1, 2002. http://www.theses.fr/2002BOR12527.
Texto completoSoto, Gomez Mauricio Abel. "Quelques propriétés topologiques des graphes et applications à internet et aux réseaux". Paris 7, 2011. http://www.theses.fr/2011PA077228.
Texto completoThis thesis focuses on topological properties of graphs and their application on communication networks, specifically on graphs reflecting Internet structure. We first look how far from a tree a graph may be by the study of two parameters: hyperbolicity and treewidth. For hyperbolicity, we analyse the relation with others graph parameters, we also show that some graph decompositions allow its efficient computation. We compute both parameters o Internet snapshots at different levels of granularity and time periods. We propose some structural and algorithmic consequences of obtained values. Then, we study the graph clustering problem from the perspective of modularity, which measures a clustering quality and is largely studied in the literature. We analyse modularity from a theoretical point of view and [describe] its asymptotic behaviour for some graph families. Finally, we deal with adversarial queueing theory, a combinatorial framework derived from classic queueing theory where injection process is und the control of an adversary. We propose a new model generalisation by considering request of distinct types
Beaudou, Laurent. "Autour de problèmes de plongements de graphes". Phd thesis, Université Joseph Fourier (Grenoble), 2009. http://tel.archives-ouvertes.fr/tel-00401226.
Texto completoBenchettara, Nasserine. "Prévision de nouveaux liens dans les réseaux d'interactions bipartis : Application au calcul de recommandation". Paris 13, 2011. http://scbd-sto.univ-paris13.fr/secure/edgalilee_th_2011_benchettara.pdf.
Texto completoIn this work, we handle the problem of new link prediction in dynamic complex networks. We mainly focus on studying networks having a bipartite underlaying structure. We propose to apply a propositionnalization approach where each couple of nodes in the network is described by a set of topological measures. One first contribution in this thesis is to consider measures computed in the bipartite graph and also in the associated projected graphs. A supervised machine learning approach is applied. This approach though it gives some good results, suffers from the obvious problem of class skewness. We hence focus on handling this problem. Informed sub-sampling approaches are first proposed. A semi-supervised machine learning approach is also applied. All proposed approaches are applied and evaluated on real datasets used in real application of academic collaboration recommendation and product recommendation in an e-commerce site
Vlitas, Dimitrios. "Contribution à la théorie de Ramsey en dimension infinie". Paris 7, 2012. http://www.theses.fr/2012PA077240.
Texto completoIn a recent paper S. Solecki proves a finite self dual Ramsey theorem that in a natural way gives simultaneously the classical finite Ramsey theorem and the Graham-Rothschild theorem. In the first chapter of this thesis we prove the corresponding infinite dimensional self dual theorem, giving similarly as a consequence the infinite classical Ramsey theorem and the Carlson-Simpson theorem. This is done by a different approach than that of Solecki. In the second chapter of the present thesis we extend a result of K. Milliken. Given a fixed tree U that has some finite uniform branching but is of infinite length, a notion of uniform family of finite strong subtrees is introduced. Then we prove a Ramsey classification result for equivalence relations defined on these uniform families. In the third and final chapter of the thesis, we complete the attempt of H. Lefmann to show that Borel equivalence relations on the n-element subsets of 2A{\omega}, that respect an order type, have a finite Ramsey basis
Bonis, Thomas. "Algorithmes d'apprentissage statistique pour l'analyse géométrique et topologique de données". Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS459/document.
Texto completoIn this thesis, we study data analysis algorithms using random walks on neighborhood graphs, or random geometric graphs. It is known random walks on such graphs approximate continuous objects called diffusion processes. In the first part of this thesis, we use this approximation result to propose a new soft clustering algorithm based on the mode seeking framework. For our algorithm, we want to define clusters using the properties of a diffusion process. Since we do not have access to this continuous process, our algorithm uses a random walk on a random geometric graph instead. After proving the consistency of our algorithm, we evaluate its efficiency on both real and synthetic data. We then deal tackle the issue of the convergence of invariant measures of random walks on random geometric graphs. As these random walks converge to a diffusion process, we can expect their invariant measures to converge to the invariant measure of this diffusion process. Using an approach based on Stein's method, we manage to obtain quantitfy this convergence. Moreover, the method we use is more general and can be used to obtain other results such as convergence rates for the Central Limit Theorem. In the last part of this thesis, we use the concept of persistent homology, a concept of algebraic topology, to improve the pooling step of the bag-of-words approach for 3D shapes
Abouelaoualim, Abdelfattah. "EXPLORATION DES GRAPHES ARETES-COLOREES : TOPOLOGIE, ALGORITHMES, COMPLEXITE ET (NON)-APPROXIMABILITE". Phd thesis, Université Paris Sud - Paris XI, 2007. http://tel.archives-ouvertes.fr/tel-00281533.
Texto completoLibros sobre el tema "Théorie topologique des graphes"
Bretto, Alain, Alain Faisant y François Hennecart. Éléments de théorie des graphes. Paris: Springer Paris, 2012. http://dx.doi.org/10.1007/978-2-8178-0281-7.
Texto completoAlain, Faisant, Hennecart François y SpringerLink (Online service), eds. Éléments de théorie des graphes. Paris: Springer Paris, 2012.
Buscar texto completo1938-, Robertson Neil, Seymour Paul D, National Science Foundation (U.S.) y United States. Office of Naval Research., eds. Graph structure theory: Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, held June 22 to July 5, 1991, with support from the National Science Foundation and the Office of Naval Research. Providence, R.I: American Mathematical Society, 1993.
Buscar texto completoWerra, D. de. Éléments de programmation linéaire avec application aux graphes. Lausanne: Presses Polytechniques Romandes, 1990.
Buscar texto completoPrins, Christian. Algorithmes de graphes: Avec programmes en Pascal. Paris: Eyrolles, 1994.
Buscar texto completoXuong, Nguyen Huy. Mathématiques discrètes et informatique. Paris: Masson, 1992.
Buscar texto completoWilson, Robin J. Introduction to graph theory. 3a ed. Harlow, Essex, England: Longman, 1985.
Buscar texto completoWilson, Robin J. Introduction to graph theory. 4a ed. Harlow: Longman, 1996.
Buscar texto completoWilson, Robin J. Introduction to graph theory. 4a ed. Harlow: Prentice Hall, 1996.
Buscar texto completoWilson, Robin J. Introduction to graph theory. 3a ed. Burnt Mill, Harlow, Essex, England: Longman Scientific & Technical, 1985.
Buscar texto completoCapítulos de libros sobre el tema "Théorie topologique des graphes"
Bretto, Alain, Alain Faisant y François Hennecart. "Graphes planaires". En Éléments de théorie des graphes, 131–81. Paris: Springer Paris, 2012. http://dx.doi.org/10.1007/978-2-8178-0281-7_5.
Texto completoBretto, Alain, Alain Faisant y François Hennecart. "Théorie algébrique". En Éléments de théorie des graphes, 183–212. Paris: Springer Paris, 2012. http://dx.doi.org/10.1007/978-2-8178-0281-7_6.
Texto completoBerge, Claude. "La Théorie des Graphes". En Development of Mathematics, 1950–2000, 135–47. Basel: Birkhäuser Basel, 2000. http://dx.doi.org/10.1007/978-3-0348-8968-1_7.
Texto completoBretto, Alain, Alain Faisant y François Hennecart. "Quelques graphes remarquables". En Éléments de théorie des graphes, 35–59. Paris: Springer Paris, 2012. http://dx.doi.org/10.1007/978-2-8178-0281-7_2.
Texto completoBretto, Alain, Alain Faisant y François Hennecart. "Automorphismes — Théorie spectrale". En Éléments de théorie des graphes, 277–325. Paris: Springer Paris, 2012. http://dx.doi.org/10.1007/978-2-8178-0281-7_9.
Texto completoBretto, Alain, Alain Faisant y François Hennecart. "Concepts fondamentaux". En Éléments de théorie des graphes, 1–34. Paris: Springer Paris, 2012. http://dx.doi.org/10.1007/978-2-8178-0281-7_1.
Texto completoBretto, Alain, Alain Faisant y François Hennecart. "Autres perspectives". En Éléments de théorie des graphes, 327–55. Paris: Springer Paris, 2012. http://dx.doi.org/10.1007/978-2-8178-0281-7_10.
Texto completoBretto, Alain, Alain Faisant y François Hennecart. "(Di)graphes et structures de données". En Éléments de théorie des graphes, 61–98. Paris: Springer Paris, 2012. http://dx.doi.org/10.1007/978-2-8178-0281-7_3.
Texto completoBretto, Alain, Alain Faisant y François Hennecart. "Connexité et flots dans les réseaux". En Éléments de théorie des graphes, 99–129. Paris: Springer Paris, 2012. http://dx.doi.org/10.1007/978-2-8178-0281-7_4.
Texto completoBretto, Alain, Alain Faisant y François Hennecart. "Coloration". En Éléments de théorie des graphes, 213–44. Paris: Springer Paris, 2012. http://dx.doi.org/10.1007/978-2-8178-0281-7_7.
Texto completo