3 citations · 4 across the 7 of their papers we have counts for
7 papers
An approximation algorithm for zero forcing
Ben Cameron, Jeannette Janssen, Rogers Matthew +1
We give an algorithm that finds a zero forcing set which approximates the optimal size by a factor of , where is the pathwidth of . Starting from…
Signal processing on large networks with group symmetries
Kathryn Beck, Mahya Ghandehari, Jeannette Janssen +1
Current methods of graph signal processing rely heavily on the specific structure of the underlying network: the shift operator and the graph Fourier transform are both derived dir…
Orthogonal Colourings of Random Geometric Graphs
Jeannette Janssen, Kyle MacKeigan
In this paper, we study orthogonal colourings of random geometric graphs. Two colourings of a graph are orthogonal if they have the property that when two vertices receive the same…
Conditions on square geometric graphs
Huda Chuangpishit, Jeannette Janssen
For any metric on , an ()-geometric graph is a graph whose vertices are points in , and two vertices are adjacent if and only if the…
Rumours spread slowly in a small world spatial network
Jeannette Janssen, Abbas Mehrabian
Rumour spreading is a protocol for modelling the spread of information through a network via user-to-user interaction. The Spatial Preferred Attachment (SPA) model is a random grap…
Finding safe strategies for competitive diffusion on trees
Jeannette Janssen, Celeste Vautour
We study the two-player safe game of Competitive Diffusion, a game-theoretic model for the diffusion of technologies or influence through a social network. In game theory, safe str…