3 papers
cs.DC2017
Distributed Domination on Graph Classes of Bounded Expansion
Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich +1
We provide a new constant factor approximation algorithm for the (connected) distance- dominating set problem on graph classes of bounded expansion. Classes of bounded expansion…
math.CO2016
Defective colouring of graphs excluding a subgraph or minor
Patrice Ossona de Mendez, Sang-il Oum, David R. Wood
Archdeacon (1987) proved that graphs embeddable on a fixed surface can be -coloured so that each colour class induces a subgraph of bounded maximum degree. Edwards, Kang, Kim, O…
math.CO2016
Existence of Modeling Limits for Sequences of Sparse Structures
J. Nesetril, P. Ossona de Mendez
A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability…