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...

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...

Charpentier, Clément Hocquard, Hervé Sopena, Eric Zhu, Xuding

The graph coloring game is a two-player game in which, given a graph G and a set of k colors, the two players, Alice and Bob, take turns coloring properly an uncolored vertex of G, Alice having the first move. Alice wins the game if and only if all the vertices of G are eventually colored. The game chromatic number of a graph G is then defined as t...

Dennunzio, Alberto Formenti, Enrico Grinberg, Darij Margara, Luciano

Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this paper states that the set $\left\{ A^0,A^1,A^2,\ldots\right\}$ is finite if and only if the set $\left\{ B^0,B...

Mariot, Luca Gadouleau, Maximilien Formenti, Enrico Leporati, Alberto

We investigate sets of Mutually Orthogonal Latin Squares (MOLS) generated by Cellular Automata (CA) over finite fields. After introducing how a CA defined by a bipermutive local rule of diameter $d$ over an alphabet of $q$ elements generates a Latin square of order $q^{d-1}$, we study the conditions under which two CA generate a pair of orthogonal ...

Sintiari, Ni Luh Dewi Trotignon, Nicolas

We present a construction called layered wheel. Layered wheels are graphs of arbitrarily large treewidth and girth. They might be an outcome for a possible theorem characterizing graphs with large treewidth in term of their induced subgraphs (while such a characterization is well understood in term of minors). They also provide examples of graphs o...

Cegielski, Patrick Cervelle, Julien

International audience

Cegielski, Patrick Cervelle, Julien

International audience

Bensmail, Julien Blanc, Thibaut Cohen, Nathann Havet, Frédéric Rocha, Leonardo

We investigate graph colouring models for the purpose of optimizing TDMA link scheduling in Wireless Networks. Inspired by the BPRN-colouring model recently introduced by Rocha and Sasaki, we introduce a new colouring model, namely the BMRN-colouring model, which can be used to model link scheduling problems where particular types of collisions mus...