1542 search results - page 177 / 309 » The metamathematics of random graphs |
100
click to vote
PAKDD
2010
ACM
15 years 6 months ago
2010
ACM
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
140
click to vote
JGAA
2007
15 years 1 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
119
click to vote
PVLDB
2008
15 years 1 months ago
2008
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...
101
click to vote
WSDM
2009
ACM
15 years 8 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
101
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...