Polynomial algorithms for sparse spanners on subcubic graphs.
Renzo GómezFlávio Keidi MiyazawaYoshiko WakabayashiPublished in: J. Comb. Optim. (2024)
Keyphrases
- learning algorithm
- theoretical analysis
- optimization problems
- sparse data
- graph matching
- combinatorial optimization
- times faster
- orders of magnitude
- computational cost
- significant improvement
- computational complexity
- data structure
- decision trees
- data mining techniques
- computationally efficient
- semi supervised
- machine learning algorithms
- benchmark datasets
- graph theory
- graph partitioning