Dynamic and i/o-efficient algorithms for computational geometry and graph problems: theoretical and experimental results
- Author:
- Yi-Jen Chiang
Abstract
No abstract available.
Cited By
- Dittrich W, Hutchinson D and Maheshwari A Blocking in parallel multisearch problems (extended abstract) Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, (98-107)
- Chiang Y, Silva C and Schroeder W Interactive out-of-core isosurface extraction Proceedings of the conference on Visualization '98, (167-174)
- Dehne F, Dittrich W and Hutchinson D Efficient external memory algorithms by simulating coarse-grained parallel algorithms Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, (106-115)
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
Dynamic algorithms for graph coloring
SODA '18: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete AlgorithmsWe design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (Δ + 1)- vertex coloring and (2Δ − 1)-edge coloring in a graph ...