2304 search results - page 232 / 461 » On the Vulnerability of Large Graphs |
269
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
163
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract— Large graph datasets are ubiquitous in many domains, including social networking and biology. Graph summarization techniques are crucial in such domains as they can ass...
190
click to vote
GECCO
2007
Springer
16 years 24 days ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
225
click to vote
FOCS
2006
IEEE
16 years 20 days ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
293
click to vote
IJCV
2006
15 years 6 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...