Author:
Alstrup Stephen,Holm Jacob,Thorup Mikkel
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. A. Kanevsky, R Tamassia, G. Battista, and J. Chen. On-line maintenance of the four-connected components of a graph (extended abstract). In 32nd FOCS, pages 793–801, 1991.
2. S. Alstrup, J. Holm, K de Lichtenberg, and M. Thorup. Minimizing diameters of dynamic trees. In ICALP’97, pages 270–280, 1997.
3. V. Auletta, D. Parente, and G. Persiano. Dynamic and static algorithms for optimal placement of resources in a tree. TCS, 165:441–461, 1996.
4. G. Battista and R. Tamassia. Incremental planarity testing (extended abstract). In 30th FOCS, pages 436–441, 1989.
5. G. Battista and R. Tamassia. On-line graph algorithms with SPQR-trees. In ICALP’90, pages 598–611, 1990.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Gapped Indexing for Consecutive Occurrences;Algorithmica;2022-10-20
2. Tight Bounds for Top Tree Compression;String Processing and Information Retrieval;2017
3. Maintaining centdians in a fully dynamic forest with top trees;Discrete Applied Mathematics;2015-01
4. Dynamic Graph Algorithms;Discrete Mathematics and Its Applications;2013-11-26
5. Tree Compression with Top Trees;Automata, Languages, and Programming;2013