Gotowa bibliografia na temat „Réseaux de graphes”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Réseaux de graphes”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Réseaux de graphes"
Díaz Villalba, Alejandro. "Comment outiller l’étude des autorités avec l’analyse de réseaux dans les grammaires françaises des XVIe et XVIIe siècles". SHS Web of Conferences 138 (2022): 03003. http://dx.doi.org/10.1051/shsconf/202213803003.
Pełny tekst źródłaLemieux, Vincent. "L'articulation des réseaux sociaux". Recherches sociographiques 17, nr 2 (12.04.2005): 247–60. http://dx.doi.org/10.7202/055716ar.
Pełny tekst źródłaPigeon, Émilie. "Réseaux sociaux catholiques et construction identitaire dans les Pays d’en haut : l’exemple du fort Michilimackinac (1741-1821)". Francophonies d'Amérique, nr 40-41 (8.03.2018): 83–112. http://dx.doi.org/10.7202/1043699ar.
Pełny tekst źródłaBonnet, Nicolas. "Résilience d’un territoire face au chômage : les réseaux d’entreprises innovantes sur Montpellier". Nouvelles perspectives en sciences sociales 5, nr 1 (23.11.2009): 97–115. http://dx.doi.org/10.7202/038625ar.
Pełny tekst źródłaDalud-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, nr 2 (22.08.2017): 41–68. http://dx.doi.org/10.7202/1040904ar.
Pełny tekst źródłaVazquez, J., M. François i D. Gilbert. "Gestion en temps réel d'un réseau d'assainissement : vérification de l'optimalité et de l'applicabilité de la théorie des graphes par rapport à la programmation linéaire mixte". Revue des sciences de l'eau 16, nr 4 (12.04.2005): 425–42. http://dx.doi.org/10.7202/705516ar.
Pełny tekst źródłaTacnet, Jean-Marc, Elodie Forestier, Eric Mermet, Corinne Curt i Frédéric Berger. "Résilience territoriale : du concept à l'analyse d'infrastructures critiques en montagne". La Houille Blanche, nr 5-6 (październik 2018): 20–28. http://dx.doi.org/10.1051/lhb/2018047.
Pełny tekst źródłaOtman, Gabriel. "Les bases de connaissances terminologiques : les banques de terminologie de seconde génération". Meta 42, nr 2 (30.09.2002): 244–56. http://dx.doi.org/10.7202/003772ar.
Pełny tekst źródłaCLAUZEL, Céline, Christophe EGGERT, Simon TARABON, Lili PASQUET, Gilles VUIDEL, Marion BAILLEUL, Claude MIAUD i Claire GODET. "Analyser la connectivité de la trame turquoise : définition, caractérisation et enjeux opérationnels". Sciences Eaux & Territoires, nr 43 (16.10.2023): 67–71. http://dx.doi.org/10.20870/revue-set.2023.43.7642.
Pełny tekst źródłaFoltête, Jean-Christophe, Céline Clauzel, Xavier Girardet, Pierline Tournant i Gilles Vuidel. "La modélisation des réseaux écologiques par les graphes paysagers. Méthodes et outils". Revue internationale de géomatique 22, nr 4 (30.12.2012): 641–58. http://dx.doi.org/10.3166/rig.22.641-658.
Pełny tekst źródłaRozprawy doktorskie na temat "Réseaux de graphes"
Tremblay, Nicolas. "Réseaux et signal : des outils de traitement du signal pour l'analyse des réseaux". Thesis, Lyon, École normale supérieure, 2014. http://www.theses.fr/2014ENSL0938/document.
Pełny tekst źródłaThis thesis describes new tools specifically designed for the analysis of networks such as social, transportation, neuronal, protein, communication networks... These networks, along with the rapid expansion of electronic, IT and mobile technologies are increasingly monitored and measured. Adapted tools of analysis are therefore very much in demand, which need to be universal, powerful, and precise enough to be able to extract useful information from very different possibly large networks. To this end, a large community of researchers from various disciplines have concentrated their efforts on the analysis of graphs, well define mathematical tools modeling the interconnected structure of networks. Among all the considered directions of research, graph signal processing brings a new and promising vision : a signal is no longer defined on a regular n-dimensional topology, but on a particular topology defined by the graph. To apply these new ideas on the practical problems of network analysis paves the way to an analysis firmly rooted in signal processing theory. It is precisely this frontier between signal processing and network science that we explore throughout this thesis, as shown by two of its major contributions. Firstly, a multiscale version of community detection in networks is proposed, based on the recent definition of graph wavelets. Then, a network-adapted bootstrap method is introduced, that enables statistical estimation based on carefully designed graph resampling schemes
Halftermeyer, Pierre. "Connexité dans les Réseaux et Schémas d’Étiquetage Compact d’Urgence". Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0140/document.
Pełny tekst źródłaWe 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
Togni, Olivier. "Force des graphes : indice optique des réseaux". Bordeaux 1, 1998. http://www.theses.fr/1998BOR10596.
Pełny tekst źródłaAïder, Méziane. "Réseaux d'interconnexion bipartis : colorations généralisées dans les graphes". Phd thesis, Grenoble 1, 1987. http://tel.archives-ouvertes.fr/tel-00325779.
Pełny tekst źródłaFraisse, Pierre. "Longs cycles dans les graphes : applications aux réseaux de Pétri". Paris 11, 1986. http://www.theses.fr/1986PA112037.
Pełny tekst źródłaThis thesis is constituted by several chapters. The first one deals with the existence of certain cycles in graphs of large degree. It gives sufficient conditions for the existence of cycles of length greater than a given number m, or dominating cycles, or circuits containing a set of s vertices and of length at most 2s. The second one gives sufficient conditions for the existence of f-factors in graphs, with conditions on the independence number, connectivity and number of edges, and also by assuming the existence of f-factors in some subgraphs. The third deals with covering of edges and vertices of a graph by cycles, the sum of the length of the cycles being minimal. The fourth attempts to find the chromatic index of random regular graphs. Finally, the fifth is an application of the graph theory to Petri nets. It gives sufficient conditions for liveness on a class of nets
Fraisse, Pierre. "Cycles et facteurs dans les graphes : application de la théorie des graphes aux réseaux de Pétri". Paris 11, 1985. http://www.theses.fr/1985PA112100.
Pełny tekst źródłaThis thesis is constituted by several chapters. The first one deals with the existence of certain cycles in graphs of large degree. It gives sufficient conditions for the existence of cycles of length greater than a given number m, of dominating cycles, of circuits containing a set of s vertices and of length at most 2s. The second one gives sufficient conditions for the existence of f-factors in graphs, with conditions of independence number and connectivity, of number of edges, and also by assuming the existence of f-factors in some subgraphs. The third deals with covering of edges and vertices of a graph by cycles, the sum of the length of the cycles being minimal. Finally, the fourth is an application of the graph theory to Petri nets. It gives sufficient conditions for liveness on a class of nets
Dhandapani, Yogeshwaran. "Réseaux géométriques aléatoires : connexité et comparaison". Paris 6, 2010. http://www.theses.fr/2010PA06A621.
Pełny tekst źródłaCoupechoux, Emilie. "Analyse de grands graphes aléatoires". Paris 7, 2012. http://www.theses.fr/2012PA077184.
Pełny tekst źródłaSeveral kinds of real-world networks can be represented by graphs. Since such networks are very large, their detailed topology is generally unknown, and we model them by large random graphs having the same local statistical properties as the observed networks. An example of such properties is the fact that real-world networks are often highly clustered : if two individuals have a friend in common, they are likely to also be each other's friends. Studying random graph models that are both appropriate and tractable from a mathematical point of view is challenging, that is why we consider several clustered random graph models. The spread of epidemics in random graphs can be used to model several kinds of phenomena in real-world networks, as the spread of diseases, or the diffusion of a new technology. The epidemic model we consider depends on the phenomenon we wish to represent :. An individual can contract a disease by a single contact with any of his friends (such contacts being independent),. But a new technology is likely to be adopted by an individual if many of his friends already have the technology in question. We essentially study these two cases. In each case, one wants to know if a small proportion of the population initially infected (or having the technology in question) can propagate the epidemic to a large part of the population
Bauguion, Pierre-Olivier. "Décomposition de multi-flots et localisation de caches dans les réseaux". Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2014. http://www.theses.fr/2014TELE0010.
Pełny tekst źródłaStreaming requirements on internet network are even more driven by new actors, new services and new digital contents. This leads to high probability of congestion, latency and therefore, a critical decrease of quality of service and/or experience for customers. An internet service provider (ISP) whose goal is to guarantee a first-class performance, needs to take measures to constantly enhance the fluidity of the traffic streaming on its network. One way to face the problem, is to build a Content Delivery Network (CDN). A CDN mainly consists in the deployment of different devices on an existing network. First of all, this thesis presents dynamic programming approaches to tackle server location problems in tree networks. Then, we address a variation of the matroïd intersection algorithm to solve the k-server/cache location problem. We start by giving the definition and characteristics of transparent-caching, as well as the hypothesis that we will use it to build models for transparent cache location in tree network. We tract it to a Mixed Integer Program, and formulate a new paradigm of dynamic programming. We show the relevance of such approach for our problem, and to what extent it can be tractable in other related problems. From a more theoretical point of view, we manage to measure the capacity of a network which is given by the optimal routing strategy, and hence, to identify its critical links. We deal with the Maximum Concurrent Flow (MCF), a classical combinatorial optimization problem. We propose new models and formulations to solve this problem exactly, and more general multi-flows problems as well. A heuristic is also given, to adapt the model to the specific instance values. We experiment these formulations to show the improvements they can provide. Finally, we describe the first strongly polynomial algorithm to solve the maximum concurrent flow to optimality, in the single source case. We show the efficiency of such an approach, even compared to the best models previously presented
Chakroun, Nasr Ali. "Problèmes de circuits, chemins et diamètres dans les graphes : routage dans les réseaux". Paris 11, 1986. http://www.theses.fr/1986PA112354.
Pełny tekst źródłaKsiążki na temat "Réseaux de graphes"
Mathis, Philippe. Graphes et réseaux: Modélisation multiniveau. Paris: Hermès science publications, 2003.
Znajdź pełny tekst źródłaJon, Kleinberg, red. Networks, crowds, and markets: Reasoning about a highly connected world. New York: Cambridge University Press, 2010.
Znajdź pełny tekst źródłaMorselli, Carlo. Inside criminal networks. New York: Springer Science+Business Media, 2009.
Znajdź pełny tekst źródłaAdobe Captivate 7: The quick visual guide. [United States]: [Createspace], 2013.
Znajdź pełny tekst źródła-C, Bermond J., Raynal M i International Workshop on Distributed Algorithms (3rd : 1989 : La Colle-sur-Loup, France), red. Distributed algorithms: 3rd international workshop, Nice, France, September 26-28, 1989 : proceedings. Berlin: Springer-Verlag, 1989.
Znajdź pełny tekst źródłaStefan, Leue, i Systä Tarja Johanna, red. Scenarios: Models, Transformations and Tools: International workshop, Dagstuhl Castle, Germany, September 7-12, 2003 : revised selected papers. Berlin: Springer, 2005.
Znajdź pełny tekst źródłaJosh, Ritchie, i Crooks Ross, red. Infographics: The power of visual storytelling. Hoboken, N.J: John Wiley & Sons, Inc., 2012.
Znajdź pełny tekst źródłaNetworking regionalised innovative labour markets. New York: Routledge, 2012.
Znajdź pełny tekst źródłaMultimedia security: Watermarking, steganography, and forensics. Boca Raton, FL: Taylor & Francis, 2012.
Znajdź pełny tekst źródłaDistributed sensor networks. Wyd. 2. Boca Raton: Chapman and Hall/CRC, 2013.
Znajdź pełny tekst źródłaCzęści książek na temat "Réseaux de graphes"
Bretto, Alain, Alain Faisant i François Hennecart. "Connexité et flots dans les réseaux". W É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.
Pełny tekst źródłaGolumbic, Martin Charles, i André Sainte-Laguë. "Tracing the topics in Les Réseaux (ou Graphes)". W The Zeroth Book of Graph Theory, 1–5. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61420-1_1.
Pełny tekst źródłaLe Blanc, Benoît. "Réseaux informatiques et modèle des graphes petits-mondes". W Les réseaux, 91–100. CNRS Éditions, 2012. http://dx.doi.org/10.4000/books.editionscnrs.19279.
Pełny tekst źródłaGUYOMAR, Cervin, i Claire LEMAITRE. "Métagénomique et métatranscriptomique". W Des séquences aux graphes, 151–86. ISTE Group, 2023. http://dx.doi.org/10.51926/iste.9066.ch5.
Pełny tekst źródłaBerthod, Jonas. "Netzwerke / Réseaux/ Networks—A Relaunch to Reposition Federal Design Promotion". W Swiss Graphic Design Histories, 101–10. Verlag Scheidegger & Spiess, 2021. http://dx.doi.org/10.53788/swbe0308.
Pełny tekst źródłaTurkina, Ekaterina, i Ari Van Assche. "GRAPPES, RÉSEAUX ET COMPÉTITIVITÉ DE L’INDUSTRIE DES TECHNOLOGIES PROPRES DU QUÉBEC". W Le Québec économique 8. Le développement durable à l'ère des changements climatiques, 93–122. Presses de l'Université Laval, 2019. http://dx.doi.org/10.2307/j.ctv1g244vc.8.
Pełny tekst źródła