Algorithms for the fixed linear crossing number problem.
Robert J. CimikowskiPublished in: Discret. Appl. Math. (2002)
Keyphrases
- computational complexity
- fixed number
- times faster
- small number
- learning algorithm
- polynomial time complexity
- significant improvement
- memory requirements
- data structure
- computational efficiency
- benchmark datasets
- computationally efficient
- np complete
- association rules
- recently developed
- computational cost
- finite number
- space complexity
- linear models
- execution times
- running times
- run times
- data mining