Literatura científica selecionada sobre o tema "Algorithmique de graphes"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Algorithmique de graphes".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Algorithmique de graphes"
Hamacher, Horst W. "Optimisation Combinatoire—Méthodes Mathematiques et Algorithmiques: Programmation Discrete; Optimisation Combinatoire Methodes Mathematiques et Algorithmiques: Graphes et Programmation Lineaire (Michel Sakarovitch)". SIAM Review 29, n.º 1 (março de 1987): 143–44. http://dx.doi.org/10.1137/1029022.
Texto completo da fonteBailblé, Olivier, e Eric Bailblé. "Les nouvelles technologies face à l’historiographie positiviste de l’histoire de France : étude sur le 19ème siècle en français : enjeux et perspectives". Matices en Lenguas Extranjeras, n.º 9 (1 de janeiro de 2015): 68–90. http://dx.doi.org/10.15446/male.n9.54913.
Texto completo da fonteDecoupigny, Christophe. "The TUREP model: micro-scale simulation of pollutants emissions". Les Cahiers Scientifiques du Transport - Scientific Papers in Transportation 52 | 2007 (30 de novembro de 2007). http://dx.doi.org/10.46298/cst.12063.
Texto completo da fontePlutniak, Sébastien. "A Precursor of Digital Humanities ? The First Automated Analysis of an Ancient Economic Network (Gardin & Garelli, 1961). Implementation, Theorization, Reception". Analyse de réseaux pour les sciences sociales, Papers (10 de setembro de 2018). http://dx.doi.org/10.46298/arcs.9236.
Texto completo da fonteBanderier, Cyril, e Michael Drmota. "Coefficients of algebraic functions: formulae and asymptotics". Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AS,..., Proceedings (1 de janeiro de 2013). http://dx.doi.org/10.46298/dmtcs.2366.
Texto completo da fonteTeses / dissertações sobre o assunto "Algorithmique de graphes"
Mazoit, Frédéric. "Décomposition algorithmique des graphes". Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2004. http://tel.archives-ouvertes.fr/tel-00148807.
Texto completo da fonteAngelier, Pierre. "Algorithmique des graphes de visibilité". Paris 7, 2002. http://www.theses.fr/2002PA077007.
Texto completo da fonteGodard, Emmanuel. "Réécritures de graphes et algorithmique distribuée". Bordeaux 1, 2002. http://www.theses.fr/2002BOR12518.
Texto completo da fonteLyaudet, Laurent. "Graphes et hypergraphes : complexités algorithmique et algébrique". Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2007. http://tel.archives-ouvertes.fr/tel-00905137.
Texto completo da fonteZiti, Soumia. "Classes particulières de graphes : aspects structurels et algorithmique". Orléans, 2006. http://www.theses.fr/2006ORLE2037.
Texto completo da fonteNichitiu, Codrin. "Algorithmique sur graphes d'automates : election d'un chef, simulations". Lyon, École normale supérieure (sciences), 1999. http://www.theses.fr/1999ENSL0138.
Texto completo da fonteChalopin, Jérémie. "Algorithmique distribuée, calculs locaux et homomorphismes de graphes". Bordeaux 1, 2006. http://www.theses.fr/2006BOR13257.
Texto completo da fonteBricage, Marie. "Modélisation et Algorithmique de graphes pour la construction de structures moléculaires". Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLV031/document.
Texto completo da fonteIn this thesis, we present an algorithmic approach allowing the generation of construction guides of organic molecular cages. These semi-molecular architectures have a defined internal space capable of trapping a target molecule called substrate. Many works propose to generate molecular organic cages obtained from symmetrical structures, which have a good complexity, but they are not specific because they do not take into account precise targets. The proposed approach makes it possible to generate guides for the construction of organic molecular cages specific to a given substrate. In order to ensure the specificity of the molecular cage for the target substrate, an intermediate structure, which is an expansion of the envelope of the target substrate, is used. This structure defines the shape of the space in which the substrate is trapped. Small sets of atoms, called molecular binding patterns, are then integrated into this intermediate structure. These molecular patterns are the sets of atoms needed by molecular cages to allow them to interact with the substrate to capture it
Durand-Lepoivre, Carole. "Ordres et graphes pseudo-hiérarchiques : théorie et optimisation algorithmique". Aix-Marseille 1, 1989. http://www.theses.fr/1989AIX11250.
Texto completo da fonteGély, Alain. "Algorithmique combinatoire : cliques, bicliques et systèmes implicatifs". Clermont-Ferrand 2, 2005. http://www.theses.fr/2005CLF22622.
Texto completo da fonteLivros sobre o assunto "Algorithmique de graphes"
Beauquier, Danièle. Eléments d'algorithmique. Paris: Masson, 1992.
Encontre o texto completo da fonteCormen, Thomas H., e Ronald L. Rivest. Introduction à l'algorithmique : Cours et exercices corrigés, 2e édition. Dunod, 2002.
Encontre o texto completo da fonteMatroid Theory and Its Applications in Electric Network Theory and Statics (Algorithms and Combinatorics). Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, 1989.
Encontre o texto completo da fonteJoseph, O'Rourke. Art gallery theorems and algorithms. Oxford University Press, 1987.
Encontre o texto completo da fonteFoundations of software technology and theoretical computer science: Ninth conference, Bangalore, India, December 1989 : proceedings. Berlin: Springer-Verlag, 1989.
Encontre o texto completo da fonteMadhavan, C. E. V. Foundations of Software Technology and Theoretical Computer Science: Ninth Conference, Bangalore, India, December 19-21, 1989 Proceedings (Lecture Notes in Computer Science). Springer, 1990.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Algorithmique de graphes"
CHATEAU, Annie, e Tom DAVOT-GRANGÉ. "Concepts méthodologiques : résolution algorithmique des problèmes bioinformatiques". In Des séquences aux graphes, 11–55. ISTE Group, 2023. http://dx.doi.org/10.51926/iste.9066.ch1.
Texto completo da fonte