Maximal origami flip graphs of flat-foldable vertices: properties and algorithms.

Thomas C. Hull Manuel Morales Sarah Nash Natalya Ter-Saakov

Published in: CoRR (2022)

Keyphrases

data mining
random graphs
graph theory
learning algorithm
significant improvement
graph properties
maximal cliques
computationally efficient
independent set
real world networks
graph mining
weighted graph
theoretical analysis
optimization problems
worst case
knn
computational cost
data structure