scientific article; zbMATH DE number 1743766
From MaRDI portal
Publication:4529259
zbMATH Open1001.60052MaRDI QIDQ4529259FDOQ4529259
Authors: Narsingh Deo, Pankaj Gupta 
Publication date: 15 October 2002
Title of this publication is not available (Why is that?)
Recommendations
- A Graph-Based Approach for Web Database Sampling
- Graph sampling
- Graph sampling
- Sampling online social networks by random walk with indirect jumps
- Estimating graph parameters with random walks
- A random-surfer web-graph model
- Sampling regular graphs and a peer-to-peer network
- Sampling Regular Graphs and a Peer-to-Peer Network
Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50)
Cited In (14)
- Crawling on Simple Models of Web Graphs
- Calculating statistics of complex networks through random walks with an application to the on-line social network bebo
- The robot crawler model on complete \(k\)-partite and Erdős-Rényi random graphs
- Sampling on bipartite networks: a comparative analysis of eight crawling methods
- Web Marshals Fighting Curly Link Farms
- Web accessibility sampling method based on node topology characteristics
- Title not available (Why is that?)
- A Graph-Based Approach for Web Database Sampling
- Modelling the navigation potential of a web page
- Title not available (Why is that?)
- A random-surfer web-graph model
- Improving random walk estimation accuracy with uniform restarts
- It's a small world for random surfers
- Algorithms and Models for the Web-Graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529259)
