Author:
Di Battista G.,Tamassia R.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference13 articles.
1. G. Di Battista and R. Tamassia, Incremental Planarity Testing,Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, pp. 436–441.
2. G. Di Battista and R. Tamassia, On-Line Planarity Testing,SIAM Journal on Computing,25(5) (1996), to appear.
3. D. Fussell, V. Ramachandran, and R. Thurimella, Finding Triconnected Components by Local Replacements,Automata, Languages and Programming (Proc. 16th ICALP), Lecture Notes in Computer Science, Vol. 372, Springer-Verlag, Berlin, 1989, pp. 379–393.
4. H. N. Gabow and R. E. Tarjan, A Linear Time Algorithm for a Special Case of Disjoint Set Union,J. Comput. Systems Sci.,30 (1985), 209–221.
5. J. Hopcroft and R. E. Tarjan, Dividing a Graph into Triconnected Components,SIAM J. Comput.,2 (1973), 135–158.
Cited by
79 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献