Discrete Applied Mathematics

The main problem today is that there is no way to estimate the execution time in advance, for the user to decide the best time to execute the query he needs for his work.. This

In this paper, we consider simple, undirected graphs in two settings: one in which the vertices are labeled and the other in which they are not. The labeled graphs correspond to

Next, Section 3.5 concerns the specific properties [11,20] that allow us to avoid the full construction of the hypercube search space. Section 3.6 presents the polynomial-time

We extend here the work initiated by Doignon and Labarre [6], who enumerated unsigned permutations whose breakpoint graph contains k cycles, to signed permutations, and prove

The tree containment problem Network N displays tree T if we can obtain a subdivision of T by removing incoming edges from reticulations and “dummy leaves”.... The tree

We show that the solution of the two-dimensional Dirichlet problem set in a plane do- main is the limit of the solutions of similar problems set on a sequence of

Nous considérons maintenant le cœur du problème qui consiste à prédire le moment fléchissant dans le cas hydro-élastique non-linéaire. En effet, prédire le moment

Now, let G be a connected graph consisting of two or more vertices, and let v be some vertex of G. For any simplicial graph G and any simplicial clique K 6 G, the line graph of