An algorithm and new bounds for the circular flow number of snarks.
Jan GoedgebeurDavide MattioloGiuseppe MazzuoccoloPublished in: CoRR (2019)
Keyphrases
- computational complexity
- dynamic programming
- learning algorithm
- optimization algorithm
- worst case
- detection algorithm
- high accuracy
- cost function
- segmentation algorithm
- error bounds
- input data
- tight bounds
- preprocessing
- computational cost
- improved algorithm
- matching algorithm
- memory requirements
- computational effort
- single scan
- objective function
- confidence bounds
- theoretical analysis
- execution times
- randomized algorithm
- recognition algorithm
- times faster
- tree structure
- experimental evaluation
- multi objective
- significant improvement
- k means
- search algorithm
- similarity measure