Un algorithme sous-optimal pour construire un graphe -arête connexe de coût minimal
Un nouveau type de preuve mathématique : le théorème des quatre couleurs. I - Exposé préliminaire
Un nouveau type de preuve mathématiques : II - Le théorème des quatre couleurs
Un théorème de décomposition des questionnaires optimaux identifiant des monômes booléens. Applications
Uniformly growing backtrack trees
Union of all the minimum cycle bases of a graph.
Unit rectangle visibility graphs.
Updating approximately complete trees
Upright-quad drawing of st-planar learning spaces.
Upward embeddings and orientations of undirected planar graphs.
Upward planar drawings and switch-regularity heuristics.
Using a graph grammar system in the finite element method
The paper presents a system of Composite Graph Grammars (CGGs) modelling adaptive two dimensional hp Finite Element Method (hp-FEM) algorithms with rectangular finite elements. A computational mesh is represented by a composite graph. The operations performed over the mesh are defined by the graph grammar rules. The CGG system contains different graph grammars defining different kinds of rules of mesh transformations. These grammars allow one to generate the initial mesh, assign values to element...
Using graph layout to visualize train interconnection data.