On the number of star samples to find a vertex or edge with given degree in a graph.

Jonathan Stokes Steven Weber

Published in: CISS (2017)

Keyphrases

undirected graph
edge weights
weighted graph
small number
directed graph
graph theory
maximum number
random graphs
number of training samples
vertex set
data sets
np complete
graph structure
directed acyclic graph
minimum weight