2304 search results - page 219 / 461 » On the Vulnerability of Large Graphs |
165
click to vote
ADMA
2008
Springer
15 years 8 months ago
2008
Springer
With a large number of news available on the internet everyday, it is an interesting work to automatically organize news events by time order and dependencies between events. The w...
147
click to vote
APVIS
2009
15 years 7 months ago
2009
The spring-electrical model based force directed algorithm is widely used for drawing undirected graphs, and sophisticated implementations can be very efficient for visualizing la...
184
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
: Network intrusion detection sensors are usually built around low level models of network traffic. This means that their output is of a similarly low level and as a consequence, ...
176
click to vote
DAM
2010
15 years 6 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
145
click to vote
PAA
2006
15 years 6 months ago
2006
This paper proposes to use three-dimensional information derived from the graph of an image function for texture description. The graph of an image function is a rumpled surface ap...