An algorithm for identifying cycle-plus-triangles graphs.
Kristóf BércziYusuke KobayashiPublished in: Discret. Appl. Math. (2017)
Keyphrases
- times faster
- dynamic programming
- learning algorithm
- computational complexity
- objective function
- matching algorithm
- detection algorithm
- cost function
- computational cost
- graph structure
- experimental evaluation
- optimal solution
- np hard
- k means
- evolutionary algorithm
- search algorithm
- graph isomorphism
- significant improvement
- delaunay triangulation
- random graphs
- image sequences
- graph theory
- clustering method
- search space
- segmentation algorithm
- theoretical analysis
- graph cuts
- high accuracy
- worst case
- semi supervised
- neural network