SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Volumn 13, Issue 6, 1995, Pages 503-538

Fully dynamic biconnectivity in graphs

(1) Henzinger, M R a

a Department of Obstetrics Gynecology (United States)

Author keywords

Data structures; Dynamic algorithms; Graph algorithms; Graph connectivity

Indexed keywords

EID: 0002251385 PISSN: 01784617 EISSN: 14320541 Source Type: Journal
DOI: 10.1007/BF01189067 Document Type: Article

Times cited : (21)

References (18)

1
- 0003415652
- Addison-Wesley, Reading, MA
- (1974) The Design and Analysis of Computer Algorithms
- Aho, A.V.¹ Hopcroft, J.E.² Ullman, J.D.³

2
- 84936682839
- B. Alpern, R. Hoover, B. Rosen, P. Sweeney, and F. K. Zadeck, Incremental Evaluation of Computational Circuits, Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, 1990, pp. 32–42.

3
- 0009750756
- On-Line Algorithms for Polynomially Solvable Satisfiability Problems
- (1991) J. Logic Programming , vol.10 , pp. 69-90
- Ausiello, G.¹ Italiano, G.F.²

4
- 84936682842
- M. D. Carrol and B. G. Ryder, Incremental Data Flow Analysis via Dominator and Attribute Updates, Proc. 15th Annual ACM SIGACT-SIGPLAN Symp. on Principles of Programming Languages, 1988, pp. 274–284.

5
- 84936682841
- D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung, Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph, Proc. 1st Annual Symp. on Discrete Algorithms 1990, pp. 1–11.

6
- 84936682829
- D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig, Sparsification—A Technique for Speeding Up Dynamic Graph Algorithms, Proc. 32nd Annual Symp. on Foundations of Computer Science, 1992.

7
- 0004325122
- Improved Sparsification
- Department of Information and Computer Science, University of California, Irvine, CA
- (1993) Technical Report 92-20
- Eppstein, D.¹ Galil, Z.² Italiano, G.F.³

8
- 0022162576
- Data Structures for On-Line Updating of Minimum Spanning Trees
- (1985) SIAM J. Comput. , vol.14 , pp. 781-798
- Frederickson, G.N.¹

9
- 84936682827
- G. N. Frederickson, Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees, Proc. 32nd Annual IEEE Symps. on Foundation of Computer Science, 1991, pp. 632–641.

10
- 85029492482
- Maintaining Biconnected Components of Dynamic Planar Graphs, Proc. 18th ICALP
- Springer-Verlag, Berlin
- (1991) Lecture Notes in Computer Science , pp. 339-350
- Galil, Z.¹ Italiano, G.F.²

11
- 0003780715
- Addison-Wesley, Reading, MA
- (1969) Graph Theory
- Harary, F.¹

12
- 84936682828
- M. R. Henzinger and V. King, Randomized Dynamic Algorithms with Polylogarithmic Time per Operation, in preparation.

13
- 0040119776
- Fully Dynamic 2-Edge-Connectivity in Planar Graphs
- Proc. 3rd Scandinavian Workshop on Algorithm Theory, Springer-Verlag, Berlin
- (1992) Lecture Notes in Computer Science, Vol. 621 , pp. 233-244
- Hershberger, J.¹ Rauch, M.² Suri, S.³

14
- 84936682825
- G. Italiano, Private communication.

15
- 0020766586
- A Data Structure for Dynamic Trees
- (1983) J. Comput. System Sci. , vol.24 , pp. 362-381
- Sleator, D.D.¹ Tarjan, R.E.²

16
- 0001790593
- Depth First Search and Linear Graph Algorithms
- (1972) SIAM Journal on Computing , vol.1 , pp. 146-160
- Tarjan, R.E.¹

17
- 0026626071
- Maintaining Bridge-Connected and Biconnected Components On-Line
- (1992) Algorithmica , vol.7 , pp. 433-464
- Tarjan, R.E.¹ Westbrook, J.²

18
- 84936682826
- M. Yannakakis, Graph Theoretic Methods in Database Theory, Proc. ACM Conf. on Principles of Database Systems, 1990, pp. 230–242.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.