Login / Signup
New heuristics for two bounded-degree spanning tree problems.
Shyam Sundar
Alok Singh
André Rossi
Published in:
Inf. Sci. (2012)
Keyphrases
</>
spanning tree
optimization problems
minimum spanning tree
databases
computational complexity
np complete
graph theoretic