Login / Signup
Computational complexity and bounds for neighbor-scattering number of graphs.
Fengwei Li
Xueliang Li
Published in:
ISPAN (2005)
Keyphrases
</>
computational complexity
small number
special case
graph theory
decision trees
multi class
memory requirements
nearest neighbor
np complete
directed graph
graph matching
finite number
graph clustering