Complexity of diameter on AT-free graphs is linear.

Oleksiy Al-Saadi Jitender S. Deogun

Published in: CoRR (2022)

Keyphrases

computational complexity
linear complexity
polynomial time complexity
computational cost
upper bound
average degree
series parallel
closed form
graph matching
space complexity
graph model
graph theoretic
complexity analysis
undirected graph
neural network
decision problems
worst case
pattern recognition