2304 search results - page 89 / 461 » On the Vulnerability of Large Graphs |
106
Voted
ICPR
2002
IEEE
16 years 2 months ago
2002
IEEE
This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensiona...
HICSS
2008
IEEE
15 years 8 months ago
2008
IEEE
Containing much valuable information, networks such as the World Wide Web, social networks and metabolic networks draw increasingly attention in scientific communities. Network cl...
110
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all an...
111
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
108
click to vote
APVIS
2006
15 years 3 months ago
2006
Information visualization has attracted much attention in recent years in many fields of science and engineering. In many applications, graphs are `dynamic' in the sense that...