Polynomial-Time Algorithms for Structurally Observable Graphs by Controlling Minimal Vertices.

Shiyong Zhu Jianquan Lu Daniel W. C. Ho Jinde Cao

Published in: CoRR (2021)

Keyphrases

worst case
planar graphs
theoretical analysis
learning algorithm
data structure
computational complexity
computational cost
computationally efficient
graph theory
weighted graph
graph structures
maximal cliques
hamiltonian cycle