Circuits in graphs through a prescribed set of ordered vertices

Computational results based on randomly generated graphs show that the number of k -branch vertices included in the spanning tree increases with the size of the vertex set V,

tation of P and Q and prove that P and Q are equivalent polyhedra. Obviously, this correspondence between the faces of P and Q preserves the inclusion and

The BnB algorithm is used to solve non-convex problems by searching the complete space of solutions for the best solution. Variants of the BnB method have been employed for

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Examples of weekly clusters of rental stations from the Velib’ bicycle station data: available occupancy profiles of selected clusters obtained with the K-means algorithm with

In Biomedical Texture Analysis (eds Depeursinge, A. Bag of visual words and fusion methods for action recognition: Comprehensive study and good practice. A density-based algorithm

A re-analysis of Barrette and others’ (1997, 1998b, 1999) beam data, taking into account the influence of beam size, shows the influence of brine volume and centrifugal acceleration

◮ A famous result by Shapley gives the extreme points (vertices) of the core for convex