15 citations · 15 across the 3 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016
Enumerations, Forbidden Subgraph Characterizations, and the Split-Decomposition
Maryam Bahrani, Jérémie Lumbroso
Forbidden characterizations may sometimes be the most natural way to describe families of graphs, and yet these characterizations are usually very hard to exploit for enumerative p…
math.CO2016
An Exact Enumeration of Distance-Hereditary Graphs
Cédric Chauve, Éric Fusy, Jérémie Lumbroso
Distance-hereditary graphs form an important class of graphs, from the theoretical point of view, due to the fact that they are the totally decomposable graphs for the split-decomp…
math.CO2016
Taming Reluctant Random Walks in the Positive Quadrant
Jeremie Lumbroso, Marni Mishna, Yann Ponty
A lattice walk model is said to be reluctant if the defining step set has a strong drift towards the boundaries. We describe efficient random generation strategies for these walks.