TimGA: A genetic algorithm for drawing undirected graphs.
Two linear time algorithms for MST on minor closed graph classes
This article presents two simple deterministic algorithms for finding the Minimum Spanning Tree in time for any non-trivial class of graphs closed on graph minors. This applies in particular to planar graphs and graphs of bounded genus. Both algorithms run on a pointer machine and they require no a priori knowledge of the structure of the class except for its density. Edge weights are only compared.
Two-layer planarization: improving on parameterized algorithmics.
Un algorithme pour la bipartition d’un graphe en sous-graphes de cardinalité fixée
Nous présentons une méthode de Séparation et Évaluation Progressive pour la bipartition d’un graphe en 2 sous-ensembles ayant une cardinalité fixée. À chaque nœud de l’arbre de recherche, nous calculons une borne inférieure en dualisant les contraintes d’intégralité et en approximant le domaine réalisable par un ellipsoïde. Une borne supérieure est également calculée par la méthode Tabou. Des résultats numériques sont présentés et commentés.
Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
A branch-and-bound method for solving the min cut with size constraint problem is presented. At each node of the branch-and-bound tree the feasible set is approximated by an ellipsoid and a lower bound is computed by minimizing the quadratic objective function over this ellipsoid. An upper bound is also obtained by a Tabu search method. Numerical results will be presented.
Union of all the minimum cycle bases of a graph.
Unit rectangle visibility graphs.
Upward embeddings and orientations of undirected planar graphs.
Variations for spanning trees.
Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard.
Vertex-transitive -complementary uniform hypergraphs.
Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains.
Visual analysis of one-to-many matched graphs.
Локально Штрикханде графы и их автоморфизмы.
Характеризация треугольных и решетчатых графов.