A note on the complexity of locating-total domination in graphs.

Hadi Rahbani Nader Jafari Rad Mohammad-Reza Sadeghi

Published in: Theor. Comput. Sci. (2019)

Keyphrases

knowledge base
directed graph
graph matching
learning algorithm
artificial intelligence
clustering algorithm
similarity measure
computational complexity
lower bound
bipartite graph
space complexity
spanning tree
graph theoretic
series parallel