83 citations · 346 across the 78 of their papers we have counts for
3 papers · 1 filter
Localization Game for Random Graphs
Andrzej Dudek, Sean English, Alan Frieze +2
We consider the localization game played on graphs in which a cop tries to determine the exact location of an invisible robber by exploiting distance probes. The corresponding grap…
Probabilistic Zero Forcing on Random Graphs
Sean English, Calum MacRury, Pawel Pralat
Zero forcing is a deterministic iterative graph coloring process in which vertices are colored either blue or white, and in every round, any blue vertices that have a single white…
An Unsupervised Framework for Comparing Graph Embeddings
Bogumil Kaminski, Pawel Pralat, Francois Theberge
Graph embedding is a transformation of vertices of a graph into set of vectors. Good embeddings should capture the graph topology, vertex-to-vertex relationship, and other relevant…