ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
1
views
0
references
Top references
cited by
1
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,047
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
Estimating the number of connected components in a graph via subgraph sampling
Author(s):
Jason M. Klusowski
,
Yihong Wu
Publication date:
2020
Journal:
Bernoulli
Read this article at
ScienceOpen
Publisher
Further versions
open (via free pdf)
oa repository (via OAI-PMH title and first author match)
Powered by
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Exponential Random Graph Models
Author and article information
Journal
DOI::
10.3150/19-BEJ1147
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
1,047
Wildlife corridors as a connected subgraph problem
Authors:
Jordan Suter
,
Ashish Sabharwal
,
Willem-Jan Van Hoeve
…
List-3-coloring ordered graphs with a forbidden induced subgraph
Authors:
Sepehr Hajebi
,
Yanjia Li
,
Sophie Spirkl
On explainability of graph neural networks via subgraph explorations
Authors:
H Yuan
,
Yu H
,
J. Wang
…
See all similar
Cited by
1
SedSVD: Statement-level software vulnerability detection based on Relational Graph Convolutional Network with subgraph embedding
Authors:
Yukun Dong
,
Yeer Tang
,
Xiaotong Cheng
…
See all cited by