Let Γ be an infinite, locally finite, connected graph with distance function δ. Given a ray P in Γ and a constant C ≥ 1, a vertex-sequence {xn}∞ n=0 ⊆ V P is said to be...
C. Paul Bonnington, R. Bruce Richter, Mark E. Watk...
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...
Marios Iliofotou, Michalis Faloutsos, Michael Mitz...