We show that for each ε > 0 and each integer ∆ ≥ 1, there exists a number g such that for any graph G of maximum degree ∆ and girth at least g, the circular chromatic in...
Most of Information Retrieval (IR) systems are still based on bag of word paradigm. This is a strong limitation if one needs high precision answers. For example, in restricted doma...
Given a graph G and an integer k, two players alternatively color the edges of G using k colors so that adjacent edges get different colors. The game chromatic index g(G) is the m...
Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg...
Abstract. The decomposition of images into their meaningful components is one of the major tasks in computer vision. Tadmor, Nezzar and Vese [1] have proposed a general approach fo...
Moncef Hidane, Olivier Lezoray, Vinh-Thong Ta, Abd...
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...