Graph sampling
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistics (62-01) Statistical sampling theory and related topics (62Dxx) Probabilistic graphical models (62H22) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cited in
(11)- Graph sampling
- Guided sampling for large graphs
- Edge estimation in population of planer graphs using sampling
- Edge estimation in the population of a binary tree using node-sampling
- Scalable Uniform Graph Sampling by Local Computation
- scientific article; zbMATH DE number 4129798 (Why is no real title available?)
- scientific article; zbMATH DE number 4142092 (Why is no real title available?)
- scientific article; zbMATH DE number 1743766 (Why is no real title available?)
- Sampling Multiple Edges Efficiently
- Statistical framework for fully register based population counts
- Graph spatial sampling
This page was built for publication: Graph sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5163780)