Sciweavers

354 search results - page 36 / 71
» The Chromatic Number Of Graph Powers
Sort
View
IM
2007
14 years 11 months ago
Pursuit-Evasion in Models of Complex Networks
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
Anthony Bonato, Pawel Pralat, Changping Wang
CAAN
2007
Springer
15 years 6 months ago
Vertex Pursuit Games in Stochastic Network Models
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
Anthony Bonato, Pawel Pralat, Changping Wang
HICSS
2008
IEEE
90views Biometrics» more  HICSS 2008»
15 years 6 months ago
Power System Extreme Event Detection: The Vulnerability Frontier
In this work we apply graph theoretic tools to provide a close bound on a frontier relating the number of line outages in a grid to the power disrupted by the outages. This fronti...
Bernard C. Lesieutre, Ali Pinar, Sandip Roy
VIS
2004
IEEE
168views Visualization» more  VIS 2004»
16 years 1 months ago
On the Role of Color in the Perception of Motion in Animated Visualizations
Although luminance contrast plays a predominant role in motion perception, significant additional effects are introduced by chromatic contrasts. In this paper, relevant results fr...
Daniel Weiskopf
NETWORKS
2010
14 years 10 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...