3471 search results - page 185 / 695 » Obstacle Numbers of Graphs |
126
click to vote
ACSAC
2005
IEEE
15 years 10 months 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...
137
click to vote
GD
2000
Springer
15 years 8 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...
138
click to vote
GPEM
2006
15 years 4 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...
134
click to vote
JGT
2010
15 years 3 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...
147
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
The instabilities of the medial axis of a shape under deformations have long been recognized as a major obstacle to its use in recognition and other applications. These instabilit...