2304 search results - page 170 / 461 » On the Vulnerability of Large Graphs |
181
click to vote
SC
2005
ACM
16 years 2 days ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
207
click to vote
KDD
2004
ACM
15 years 12 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
156
click to vote
ICRA
1999
IEEE
15 years 10 months ago
1999
IEEE
We consider the robot exploration of a planar graphlike world. The robot's goal is to build a complete map of its environment. The environment is modeled as an arbitrary undi...
214
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
165
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...