Bensmail, Julien Fioravantes, Foivos

In a recent work, Bensmail, Blanc, Cohen, Havet and Rocha, motivated by applications for TDMA scheduling problems, have introduced the notion of BMRN*-colouring of digraphs, which is a type of arc-colouring with particular colouring constraints. In particular, they gave a special focus to planar digraphs. They notably proved that every planar digra...

Bensmail, Julien

The oriented (resp. 2-edge-coloured) chromatic number χₒ(G) (resp. χ₂(G)) of an undirected graph G is defined as the maximum oriented (resp. 2-edge-coloured) chromatic number of an orientation (resp. signature) of G. Although the difference between χₒ(G) and χ₂(G) can be arbitrarily large, there are, however, contexts in which these two parameters ...

Brabant, Quentin Couceiro, Miguel Figueira, José

This paper deals with the problem of interpolating partial functions over finite distributive lattices by lattice polynomial functions. More precisely, this problem can be formulated as follows: Given a finite dis-tributive lattice L and a partial function f from D ⊆ L n to L, find all the lattice polynomial functions that interpolate f on D. If th...

Brabant, Quentin Couceiro, Miguel Figueira, José

This paper deals with the problem of interpolating partial functions over finite distributive lattices by lattice polynomial functions. More precisely, this problem can be formulated as follows: Given a finite dis-tributive lattice L and a partial function f from D ⊆ L n to L, find all the lattice polynomial functions that interpolate f on D. If th...

Brabant, Quentin Couceiro, Miguel Figueira, José

This paper deals with the problem of interpolating partial functions over finite distributive lattices by lattice polynomial functions. More precisely, this problem can be formulated as follows: Given a finite dis-tributive lattice L and a partial function f from D ⊆ L n to L, find all the lattice polynomial functions that interpolate f on D. If th...

Brabant, Quentin Couceiro, Miguel Figueira, José

This paper deals with the problem of interpolating partial functions over finite distributive lattices by lattice polynomial functions. More precisely, this problem can be formulated as follows: Given a finite dis-tributive lattice L and a partial function f from D ⊆ L n to L, find all the lattice polynomial functions that interpolate f on D. If th...

Brabant, Quentin Couceiro, Miguel Figueira, José

This paper deals with the problem of interpolating partial functions over finite distributive lattices by lattice polynomial functions. More precisely, this problem can be formulated as follows: Given a finite dis-tributive lattice L and a partial function f from D ⊆ L n to L, find all the lattice polynomial functions that interpolate f on D. If th...

Brabant, Quentin Couceiro, Miguel Figueira, José

This paper deals with the problem of interpolating partial functions over finite distributive lattices by lattice polynomial functions. More precisely, this problem can be formulated as follows: Given a finite dis-tributive lattice L and a partial function f from D ⊆ L n to L, find all the lattice polynomial functions that interpolate f on D. If th...

Guttmann-Beck, Nili Sorek, Zeev Stern, Michal

Let H = be a hypergraph, where V is a set of vertices and S is a set of not necessarily disjoint clusters Si ⊆ V. The Clustered Spanning Tree problem is to find a spanning tree of G which satisfies that each cluster induces a subtree, when it exists. We provide an efficient and unique algorithm which finds a feasible solution tree for H when it exi...

Ennafii, Oussama Le Bris, Arnaud Lafarge, Florent Mallet, Clément

The generation of 3D building models from Very High Resolution geospatial data is now an automatized procedure. However , urban areas are very complex and practitioners still have to visually assess the correctness of these models and detect reconstruction errors. We proposed an approach for automatically evaluating the quality of 3D building model...