420 search results - page 22 / 84 » Generating random regular graphs |
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
ISPA
2004
Springer
14 years 1 months ago
2004
Springer
The Monte Carlo (MC) method is a simple but effective way to perform simulations involving complicated or multivariate functions. The QuasiMonte Carlo (QMC) method is similar but...
DCC
2001
IEEE
14 years 7 months ago
2001
IEEE
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
ICIP
2008
IEEE
14 years 2 months ago
2008
IEEE
In the area of depth estimation from images an interesting approach has been structure recovery from defocus cue. Towards this end, there have been a number of approaches [4, 6]. ...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...