Algorithms for Finding Diameter Cycles of Biconnected Graphs.

Mehmet Hakan Karaata

Published in: J. Comput. Inf. Technol. (2020)

Keyphrases

graph theory
times faster
learning algorithm
data structure
theoretical analysis
computationally efficient
maximum clique
graph theoretic
recently developed
orders of magnitude
computational complexity
benchmark datasets
neural network
data mining techniques
association rules
feature selection
genetic algorithm