3211 search results - page 172 / 643 » On the Grundy Number of a Graph |
160
click to vote
ACSAC
2005
IEEE
16 years 2 days ago
2005
IEEE
We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show atta...
161
click to vote
GD
2000
Springer
15 years 10 months ago
2000
Springer
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
169
click to vote
GPEM
2006
15 years 6 months ago
2006
There are various representations for encoding graph structures, such as artificial neural networks (ANNs) and circuits, each with its own strengths and weaknesses. Here we analyz...
169
click to vote
JGT
2010
15 years 4 months ago
2010
An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, deno...
155
click to vote
JCT
2008
15 years 6 months ago
2008
A graph G is k-linked if G has at least 2k vertices, and for every sequence x1, x2, . . . , xk, y1, y2, . . . , yk of distinct vertices, G contains k vertex-disjoint paths P1, P2,...