2304 search results - page 150 / 461 » On the Vulnerability of Large Graphs |
157
click to vote
GD
1995
Springer
15 years 9 months ago
1995
Springer
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
183
click to vote
LREC
2008
15 years 7 months ago
2008
We propose two general and robust methods for enriching resources annotated in the Frame Semantic paradigm with syntactic dependency graphs, which can provide useful additional in...
186
click to vote
DAGM
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
128
click to vote
APPROX
2007
Springer
16 years 14 days ago
2007
Springer
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relati...
163
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...