Author:
Westbrook Jeffery,Tarjan Robert E.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference26 articles.
1. B. Awerbuch and Y. Shiloach. New connectivity and msf algorithms for shuffle-exchange network and PRAM.IEEE Trans. Comput.,36:1258–1263, 1987.
2. G. D. Battista and R. Tamassia. Incremental planarity testing.Proc. 30th IEEE Symposium on Foundations of Computer Science, pages 436–441, 1989.
3. G. D. Battista and R. Tamassia. On-line graph algorithms with spqr-trees.Proc. 17th Internat. Conf. on Automata, Languages, and Programming (ICALP 1990). Lecture Notes in Computer Science, vol. 443, pages 598–611. Springer-Verlag, Berlin, 1990.
4. N. Blum. On the single-operation worst-case time complexity of the disjoint set union problem.SIAM J. Comput., 15:1021–1024, 1986.
5. G. A. Cheston. Incremental Algorithms in Graph Theory. Ph.D. thesis, Dept. of Computer Science, University of Toronto, 1976. Technical Report No. 91.
Cited by
86 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Emergence of biconnected clusters in explosive percolation;Physical Review E;2024-07-16
2. Parametric matroid interdiction;Discrete Optimization;2024-02
3. Best Community Discovery on Dynamic Social Networks;2022 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom);2022-12
4. A survey on mining and analysis of uncertain graphs;Knowledge and Information Systems;2022-06-28
5. CALDERA: finding all significant de Bruijn subgraphs for bacterial GWAS;Bioinformatics;2022-06-24