Login / Signup
On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree.
Min Chen
Weiqiang Yu
Weifan Wang
Published in:
Appl. Math. Comput. (2018)
Keyphrases
</>
vertex set
random graphs
undirected graph
weighted graph
maximum distance
graph theoretic
high dimensional
phase transition
bayesian networks
feature space
np hard
markov chain
sparse representation
directed graph