An example of geometric origami design with benefit of graph enumeration algorithms.
David DureisseixPublished in: CoRR (2015)
Keyphrases
- graph theory
- significant improvement
- computational cost
- theoretical analysis
- computationally efficient
- search space
- user interface
- partitioning algorithm
- combinatorial optimization
- graph theoretic
- depth first search
- maximal clique enumeration
- learning algorithm
- graph theoretical
- maximum flow
- graph structures
- graph construction
- graph representation
- spanning tree
- connected components
- worst case
- search algorithm