723 search results - page 36 / 145 » On the hyperbolicity constant in graphs |
133
click to vote
ALT
2009
Springer
16 years 3 months ago
2009
Springer
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown and...
164
click to vote
FAW
2009
Springer
16 years 25 days ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
146
click to vote
WG
2007
Springer
16 years 11 days ago
2007
Springer
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...
165
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
174
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...