Sciweavers

2304 search results - page 60 / 461
» On the Vulnerability of Large Graphs
Sort
View
ICDM
2008
IEEE
106views Data Mining» more  ICDM 2008»
15 years 6 months ago
Metropolis Algorithms for Representative Subgraph Sampling
While data mining in chemoinformatics studied graph data with dozens of nodes, systems biology and the Internet are now generating graph data with thousands and millions of nodes....
Christian Hübler, Hans-Peter Kriegel, Karsten...
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
15 years 4 months ago
Towards an Analysis of Local Optimization Algorithms
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
Tassos Dimitriou, Russell Impagliazzo
WWW
2010
ACM
15 years 6 months ago
Measurement-calibrated graph models for social network experiments
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
Alessandra Sala, Lili Cao, Christo Wilson, Robert ...
JCT
2006
102views more  JCT 2006»
14 years 11 months ago
Hamiltonicity in 3-connected claw-free graphs
Kuipers and Veldman conjectured that any 3-connected claw-free graph with order and minimum degree +6 10 is Hamiltonian for sufficiently large. In this paper, we prove that if...
Hong-Jian Lai, Yehong Shao, Mingquan Zhan
ICPR
2008
IEEE
15 years 6 months ago
An approximate algorithm for median graph computation using graph embedding
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
Miquel Ferrer, Ernest Valveny, Francesc Serratosa,...