Sciweavers

267 search results - page 19 / 54
» Anti-Ramsey properties of random graphs
Sort
View
ALT
2007
Springer
14 years 5 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
WAW
2007
Springer
157views Algorithms» more  WAW 2007»
14 years 2 months ago
Stochastic Kronecker Graphs
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
Mohammad Mahdian, Ying Xu 0002
IM
2008
13 years 8 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 8 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
GBRPR
2007
Springer
14 years 2 months ago
Grouping Using Factor Graphs: An Approach for Finding Text with a Camera Phone
Abstract. We introduce a new framework for feature grouping based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables....
Huiying Shen, James Coughlan