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

메뉴 건너뛰기

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 7-13

Dynamic subgraph connectivity with geometric applications

(1) Chan, Timothy M a

a UNIVERSITY OF WATERLOO (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DATA STRUCTURES; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY;

DYNAMIC GEOMETRIC CONNECTIVITY; DYNAMIC SUBGRAPH CONNECTIVITY;

GRAPH THEORY;

EID: 0036039017 PISSN: 07349025 EISSN: None Source Type: Conference Proceeding
DOI: 10.1145/509907.509911 Document Type: Conference Paper

Times cited : (16)

References (28)

1
- 51249162160
- Can visibility graphs be represented compactly?
- (1994) Discrete Comput. Geom. , vol.12 , pp. 347-365
- Agarwal, P.K.¹ Alon, N.² Aronov, B.³ Suri, S.⁴

2
- 0001848776
- Geometric range searching and its relatives
- (B. Chazelle, J. E. Goodman, and R. Pollack, eds.); AMS Press
- (1999) Advances in Discrete and Computational Geometry , pp. 1-56
- Agarwal, P.K.¹ Erickson, J.²

3
- 1542401272
- Polygon and connected component intersection searching
- (1996) Algorithmica , vol.15 , pp. 626-660
- Agarwal, P.K.¹ Van Kreveld, M.²

4
- 0000445027
- Finding and counting given length cycles
- (1997) Algorithmica , vol.17 , pp. 209-223
- Alon, N.¹ Yuster, R.² Zwick, U.³

5
- 0000108833
- Decomposable searching problems I: Static-to-dynamic transformation
- (1980) J. Algorithms , vol.1 , pp. 301-358
- Bentley, J.¹ Saxe, J.²

6
- 0034826620
- A fully dynamic algorithm for planar width
- (2001) Proc. 17th ACM Sympos. Comput. Geom. , pp. 172-176
- Chan, T.M.¹

7
- 84968845870
- Semi-online maintenance of geometric optima and measures
- (2002) Proc. 13th ACM-SIAM Sympos. Discrete Algorithms , pp. 474-483
- Chan, T.M.¹

8
- 85023205150
- Matrix multiplication via arithmetic progressions
- (1990) J. Symbolic Comput. , vol.9 , pp. 251-280
- Coppersmith, D.¹ Winograd, S.²

9
- 0004116989
- McGraw-Hill
- (2001) Introduction to Algorithms (2nd Ed.)
- Cormen, T.H.¹ Leiserson, C.E.² Rivest, R.L.³ Stein, C.⁴

10
- 0034497115
- 2) barrier
- (2000) Proc. 41st IEEE Sympos. Found. Comput. Sci. , pp. 381-389
- Demetrescu, C.¹ Italiano, G.F.²

11
- 0005377778
- Maintenance of geometric extrema
- (1991) J. ACM , vol.38 , pp. 275-298
- Dobkin, D.¹ Suri, S.²

12
- 51249166505
- Dynamic euclidean minimum spanning trees and extrema of binary functions
- (1995) Discrete Comput. Geom. , vol.13 , pp. 111-122
- Eppstein, D.¹

13
- 0031221723
- Sparisification: A technique for speeding up dynamic graph algorithms
- (1997) J. ACM , vol.44 , pp. 669-696
- Eppstein, D.¹ Galil, Z.² Italiano, G.F.³ Nissenzweig, A.⁴

14
- 0029392998
- Clique partitions, graph compression and speeding up algorithms
- (1995) J. Comput. Sys. Sci. , vol.51 , pp. 261-272
- Feder, T.¹ Motwani, R.²

15
- 0022162576
- Data structures for on-line updating of minimum spanning trees, with applications
- (1998) SIAM J. Comput. , vol.14 , pp. 781-798
- Frederickson, G.N.¹

16
- 0005369070
- Dynamically switching vertices in planar graphs
- (2000) Algorithmica , vol.28 , pp. 76-103
- Frigioni, D.¹ Italiano, G.F.²

17
- 0000538343
- Randomized dynamic graph algorithms with polylogarithmic time per operation
- (1999) J. ACM , vol.46 , pp. 502-516
- Henzinger, M.R.¹ King, V.²

18
- 0036253382
- Maintaining minimum spanning forests in dynamic graphs
- (2001) SIAM J. Comput. , vol.31 , pp. 364-374
- Henzinger, M.R.¹ King, V.²

19
- 0032683170
- Kinetic connectivity of rectangles
- (1999) Proc. 15th ACM Sympos. Comput. Geom. , pp. 237-246
- Hershberger, J.¹ Suri, S.²

20
- 64049109309
- Simplified kinetic connectivity for rectangles and hypercubes
- (2001) Proc. 12th ACM-SIAM Sympos. Discrete Algorithms , pp. 158-167
- Hershberger, J.¹ Suri, S.²

21
- 0031619858
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- (1998) Proc. 30th ACM Sympos. Theory Comput. , pp. 79-89
- Holm, J.¹ De Lichtenberg, K.² Thorup, M.³

22
- 0005256455
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- (1983) J. Algorithms , vol.4 , pp. 310-323
- Imai, H.¹ Asano, T.²

23
- 0005269485
- On certificates and lookahead on dynamic graph problems
- (1998) Algorithmica , vol.21 , pp. 377-394
- Khanna, S.¹ Motwani, R.² Wilson, R.H.³

24
- 0029291226
- On computing connected components of line segments
- (1995) IEEE Trans. Comput. , vol.44 , pp. 597-601
- Lopez, M.A.¹ Thurimella, R.²

25
- 0003538552
- Prentice-Hall
- (1994) Computational Geometry: An Introduction Through Randomized Algorithms
- Mulmuley, K.¹

26
- 0003487647
- Springer-Verlag
- (1985) Computational Geometry: An Introduction
- Preparata, F.P.¹ Shamos, M.I.²

27
- 0000559410
- Decremental dynamic connectivity
- (1999) J. Algorithms , vol.33 , pp. 229-243
- Thorup, M.¹

28
- 0033708138
- Near-optimal fully-dynamic graph connectivity
- (2000) Proc. 32nd ACM Sympos. Theory Comput. , pp. 343-350
- Thorup, M.¹

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