Revisiting 2-3 red-black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking.
Kamaledin Ghiasi-ShiraziTaraneh GhandiAli TaghizadehAli Rahimi-BaigiPublished in: Acta Informatica (2024)
Keyphrases
- preprocessing
- times faster
- matching algorithm
- experimental evaluation
- k means
- np hard
- segmentation algorithm
- computationally efficient
- cost function
- worst case
- single pass
- optimization algorithm
- learning algorithm
- dynamic programming
- computational complexity
- particle swarm optimization
- theoretical analysis
- markov random field
- search space