Login / Signup
Complexity of total outer-connected domination problem in graphs.
B. S. Panda
Arti Pandey
Published in:
Discret. Appl. Math. (2016)
Keyphrases
</>
computational complexity
real time
information retrieval
information systems
decision problems
genetic algorithm
search algorithm
np complete
directed graph
graph model
space complexity
polynomial time complexity