Login / Signup
Extremal k-forcing sets in oriented graphs.
Yair Caro
Randy Davila
Ryan Pepper
Published in:
Discret. Appl. Math. (2019)
Keyphrases
</>
graph theory
graph mining
graph matching
directed graph
graph theoretic
random walk
graph isomorphism
machine learning
decision trees
data structure
graph representation
maximal cliques