Sciweavers

2304 search results - page 16 / 461
» On the Vulnerability of Large Graphs
Sort
View
PAKDD
2010
ACM
203views Data Mining» more  PAKDD 2010»
14 years 2 months ago
Finding Itemset-Sharing Patterns in a Large Itemset-Associated Graph
Both itemset mining and graph mining have been studied independently. Here, we introduce a novel data structure, which is an unweighted graph whose vertices contain itemsets. From ...
Mutsumi Fukuzaki, Mio Seki, Hisashi Kashima, Jun S...
GD
2000
Springer
14 years 1 months ago
A Fast Multi-scale Method for Drawing Large Graphs
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graph...
David Harel, Yehuda Koren
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 2 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
JGAA
2007
93views more  JGAA 2007»
13 years 9 months ago
Large-Graph Layout Algorithms at Work: An Experimental Study
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
Stefan Hachul, Michael Jünger
DISCEX
2003
IEEE
14 years 2 months ago
Cooperative Response Strategies for Large Scale Attack Mitigation
We introduce models for cooperative mitigating response strategies to suppress large scale Internet worm attack. In our models, cooperating members communicate with others using a...
D. Nojiri, Jeff Rowe, Karl N. Levitt