Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs.
Yuhang BaiZhiwei GuoShenggui ZhangYandong BaiPublished in: J. Comb. Optim. (2023)
Keyphrases
- worst case
- times faster
- learning algorithm
- computational cost
- computationally efficient
- binary search trees
- significant improvement
- orders of magnitude
- graph matching
- exhaustive search
- polynomial time complexity
- maximum clique
- planar graphs
- running times
- linear space
- graph theoretic
- linear models
- upper bound
- computational complexity
- bayesian networks