Gotowa bibliografia na temat „Graphes de propriétés”
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 „Graphes de propriétés”.
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 "Graphes de propriétés"
Colin de Verdière, Yves. "Le trou spectral des graphes et leurs propriétés d'expansion". Séminaire de théorie spectrale et géométrie 12 (1994): 51–68. http://dx.doi.org/10.5802/tsg.145.
Pełny tekst źródłaDelhommé, Christian. "Propriétés de Projection des Graphes sans Triangle ni Carré". European Journal of Combinatorics 17, nr 1 (styczeń 1996): 15–22. http://dx.doi.org/10.1006/eujc.1996.0002.
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łaBélanger, Marie-France, Julien Constantin i Gilles Fournier. "Graphes et ordonnés démontables, propriété de la clique fixe". Discrete Mathematics 130, nr 1-3 (lipiec 1994): 9–17. http://dx.doi.org/10.1016/0012-365x(92)00518-v.
Pełny tekst źródłaBadariotti, Dominique, Cyril Meyer i Yasmina Ramarani. "MoGUS, un outil de modélisation et d’analyse comparative des trames urbaines". Revue Internationale de Géomatique 30, nr 3-4 (lipiec 2020): 181–213. http://dx.doi.org/10.3166/rig.2021.00109.
Pełny tekst źródłaTaylor, K. W. "Vietnam - Propriété Privée et Propriété Collective dans L'Ancien Vietnam. By Ngo Kim Chung and Nguyen Duc Nghinh. Paris: L'Harmattan, 1987. Pp. 227. Abbreviations, Tables, Graphs, Bibliography, Index." Journal of Southeast Asian Studies 21, nr 2 (wrzesień 1990): 516–18. http://dx.doi.org/10.1017/s0022463400003787.
Pełny tekst źródłaGarcia-Debanc, Claudine, Myriam Bras i Laure Vieu. "Annotation de la cohérence dans des textes d’élèves et jugements de cohérence d’enseignants du primaire". SHS Web of Conferences 186 (2024): 03003. http://dx.doi.org/10.1051/shsconf/202418603003.
Pełny tekst źródłaLanini, Martina. "Moment graphs and KL-polynomials". Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AR,..., Proceedings (1.01.2012). http://dx.doi.org/10.46298/dmtcs.3057.
Pełny tekst źródłaDolęga, Maciej, i Piotr Sniady. "Polynomial functions on Young diagrams arising from bipartite graphs". Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AO,..., Proceedings (1.01.2011). http://dx.doi.org/10.46298/dmtcs.2908.
Pełny tekst źródłaTenner, Bridget Eileen. "Boolean complexes and boolean numbers". Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AN,..., Proceedings (1.01.2010). http://dx.doi.org/10.46298/dmtcs.2833.
Pełny tekst źródłaRozprawy doktorskie na temat "Graphes de propriétés"
Ducoffe, Guillaume. "Propriétés métriques des grands graphes". Thesis, Université Côte d'Azur (ComUE), 2016. http://www.theses.fr/2016AZUR4134/document.
Pełny tekst źródłaLarge scale communication networks are everywhere, ranging from data centers withmillions of servers to social networks with billions of users. This thesis is devoted tothe fine-grained complexity analysis of combinatorial problems on these networks.In the first part, we focus on the embeddability of communication networks totree topologies. This property has been shown to be crucial in the understandingof some aspects of network traffic (such as congestion). More precisely, we studythe computational complexity of Gromov hyperbolicity and of tree decompositionparameters in graphs – including treelength and treebreadth. On the way, we givenew bounds on these parameters in several graph classes of interest, some of thembeing used in the design of data center interconnection networks. The main resultin this part is a relationship between treelength and treewidth: another well-studiedgraph parameter, that gives a unifying view of treelikeness in graphs and has algorithmicapplications. This part borrows from graph theory and recent techniques incomplexity theory. The second part of the thesis is on the modeling of two privacy concerns with social networking services. We aim at analysing information flows in these networks,represented as dynamical processes on graphs. First, a coloring game on graphs isstudied as a solution concept for the dynamic of online communities. We give afine-grained complexity analysis for computing Nash and strong Nash equilibria inthis game, thereby answering open questions from the literature. On the way, wepropose new directions in algorithmic game theory and parallel complexity, usingcoloring games as a case example
Ravaux, Romain. "Graphes arbitrairement partitionnables : propriétés structurelles et algorithmiques". Versailles-St Quentin en Yvelines, 2009. http://www.theses.fr/2009VERS0017.
Pełny tekst źródłaGraphes decomposition problems are in the heart of graphes theory. In this thesis we study the problem Graph_Partition wich in defined as follow. Being done a n-vertex graph ans a partition of n (a sequence of positives integers whose sum is equal to n), does it exists a partition of the vertex set such that every set of the partition induce a connected sub-graph, and the sequence of vertices numbers of these sub-graphes is a permutation of the partition of n. If a such partition of the vertex set exists, we say that the graph is decomposable for this partition of n. The problem Graph_Partition has already been the target of several studies. It has been shown that this problem is NP-Complet even restreint to the set of trees, and arbitrarily decomposable trees are principaly of degree 3. In this thesis we have in a first time continued structural study on arbitrarily decomposable and we have started structural studies on arbitrarily decomposable graphs. We have shown that arbitrarily decomposable trees with length arbitrarily haigh are exactly the set of combs. We gave an introduction building wich allow to construct arbitrarily decomposable combs with a number of degree 3 vertices and a length arbitrarily high. We have also given a first contribution concerning structural study of arbitrarily decomposable minimal graphs (whatever the edge you remove from the graph, the remaining graph is not arbitrarily decomposable). In a second time we study algorithmic aspect. We have shown that if we consider partition of n containing few integers, it is possible to determine enough quickly if a graph in decomposable for this partition of n. We have extended this result over the graphs containing few degree 3 vertices. Finally we have shown that it is possible to decide enough quickly if a tree with large diameter in arbitrarily decomposable
Zuk, Andrzej. "Sur certaines propriétés spectrales du Laplacien sur les graphes". Toulouse 3, 1996. http://www.theses.fr/1996TOU30272.
Pełny tekst źródłaMostefaoui, Mustapha. "Analyse des propriétés temporelles des graphes d'événements valués continus". Nantes, 2001. http://www.theses.fr/2001NANT2100.
Pełny tekst źródłaColcombet, Thomas. "Représentations et propriétés de structures infinies". Rennes 1, 2004. http://www.theses.fr/2004REN10094.
Pełny tekst źródłaBirmelé, Étienne. "Largeur d'arborescence quasi-clique-mineurs et propriétés d'erdos-posa". Lyon 1, 2003. http://www.theses.fr/2003LYO10259.
Pełny tekst źródłaDelhommé, Christian. "Propriétés de projection". Lyon 1, 1995. http://www.theses.fr/1995LYO10159.
Pełny tekst źródłaBarbar, Kablan. "Grammaires d'arbres attribuées : méthodes de vérification des propriétés de graphes engendrés". Bordeaux 1, 1988. http://www.theses.fr/1988BOR10595.
Pełny tekst źródłaChepoi, Victor. "Métriques et convexité dans les graphes et espaces discrèts : propriétés et algorithmes". Aix-Marseille 2, 1997. http://www.theses.fr/1997AIX22124.
Pełny tekst źródłaSoto, 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.
Pełny tekst źródłaThis 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
Książki na temat "Graphes de propriétés"
Aldrich, Douglas F. Mastering the digital marketplace: Practical strategies for competitiveness in the new economy. New York: Wiley, 1999.
Znajdź pełny tekst źródłaGraphene Science Handbook. Taylor & Francis Group, 2016.
Znajdź pełny tekst źródłaGraphene Science Handbook. Taylor & Francis Group, 2016.
Znajdź pełny tekst źródłaGraphene Science Handbook. Taylor & Francis Group, 2016.
Znajdź pełny tekst źródłaGraphene Science Handbook. Taylor & Francis Group, 2016.
Znajdź pełny tekst źródłaTour, James, i Ruquan Ye. Laser‐Induced Graphene. Jenny Stanford Publishing, 2020.
Znajdź pełny tekst źródłaTour, James, i Ruquan Ye. Laser‐Induced Graphene. Jenny Stanford Publishing, 2020.
Znajdź pełny tekst źródłaLaser‐Induced Graphene. Jenny Stanford Publishing, 2020.
Znajdź pełny tekst źródłaTour, James, i Ruquan Ye. Laser‐Induced Graphene. Jenny Stanford Publishing, 2020.
Znajdź pełny tekst źródłaAli, Nasar, Mahmood Aliofkhazraei, William I. Milne, Cengiz S. Ozkan i Stanislaw Mitura. Graphene Science Handbook: Fabrication Methods. Taylor & Francis Group, 2016.
Znajdź pełny tekst źródłaCzęści książek na temat "Graphes de propriétés"
Colomban, Philippe. "Nano-optique, céramiques et verres nano-structurés, des pratiques millénaires". W Regards croisés: quand les sciences archéologiques rencontrent l'innovation, 99–122. Editions des archives contemporaines, 2017. http://dx.doi.org/10.17184/eac.3792.
Pełny tekst źródła