9 citations · 42 across the 19 of their papers we have counts for
4 papers · 1 filter
Cover and Hitting Times of Hyperbolic Random Graphs
Marcos Kiwi, Markus Schepers, John Sylvester
We study random walks on the giant component of Hyperbolic Random Graphs (HRGs), in the regime when the degree distribution obeys a power law with exponent in the range . In…
The Power of Filling in Balanced Allocations
Dimitrios Los, Thomas Sauerwald, John Sylvester
We introduce a new class of balanced allocation processes which are primarily characterized by ``filling'' underloaded bins. A prototypical example is the Packing process: At each…
Bounds on the Twin-Width of Product Graphs
William Pettersson, John Sylvester
Twin-width is a graph width parameter recently introduced by Bonnet, Kim, Thomassé & Watrigant. Given two graphs and and a graph product , we address the question: i…
A New Temporal Interpretation of Cluster Editing
Cristiano Bocci, Chiara Capresi, Kitty Meeks +1
The NP-complete graph problem Cluster Editing seeks to transform a static graph into a disjoint union of cliques by making the fewest possible edits to the edges. We introduce a na…