Login / Signup
Maximal origami flip graphs of flat-foldable vertices: properties and algorithms.
Thomas C. Hull
Manuel Morales
Sarah Nash
Natalya Ter-Saakov
Published in:
J. Graph Algorithms Appl. (2022)
Keyphrases
</>
graph theory
random graphs
computationally efficient
computational cost
theoretical analysis
maximal cliques
graph properties
learning algorithm
significant improvement
weighted graph
graph theoretic
independent set
polynomial time complexity