Fully dynamic cycle-equivalence in graphs

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 1994, Pages 744-755

  Henzinger, Monika Rauch ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA FLOW GRAPHS; DATA TRANSFER; EQUIVALENCE CLASSES; GRAPHIC METHODS; UNDIRECTED GRAPHS;

CONTROL DATA; CONTROL-FLOW; CONTROL-FLOW GRAPHS; CUT EDGE; DATAFLOW; FLOW ALGORITHM; LINEAR TIME; OPTIMIZING COMPILERS; SPEED UP; UNDIRECTED GRAPH;

DATA FLOW ANALYSIS;

EID: 33745516638     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1994.365718     Document Type: Conference Paper

References (18)

1. D. Alberts and M. Rauch Henzinger, Average Case Analysis of Dynamic Graph Algorithms. Technical Report 1994, International Computer Science Institute, Berkeley, CA.
2. D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, M. Yung, "Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph" J.Algorithms, 13 (1992), 33-54.
3. D. Eppstein, Z. Galil, and G. F. Italiano "Improved Sparsification" Tech. Report 93-20, Department of Information and Computer Science, University of California, Irvine, CA 92717.
4. D. Eppstein, Z. Galil, G. F. Italiano, A. Nissenzweig, "Sparsification - A technique for speeding up dynamic graph algorithms" Proc. 33nd Annual Symp. on Foundations of Computer Science, 1992, 60-69.
5. D. Eppstein, Z. Galil, G. F. Italiano, and T. Spencer. "Separator based sparsification for dynamic planar graph algorithms". Proc. 25th Annual Symp. on Theory of Computing, 1993, 208-217.
6. G. N. Frederickson, "Data Structures for On-line Updating of Minimum Spanning Trees" SIAM J. Comput. 14 (1985), 781-798.
7. G. N. Frederickson, "Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees" Proc. 32nd Annual IEEE Sympos. on Foundation of Comput. Sci., 1991, 632-641.
8. M. L. Fredman, and M. E. Saks, "The Cell Probe Complexity of Dynamic Data Structures", Proc. 19th Annual Symp. on Theory of Computing, 1989, 345-354.
9. Z. Galil, G. F. Italiano, "Fully dynamic algorithms for 3-edge connectivity". Manuscript.
10. J. Hershberger, M. Rauch, S. Suri, "Data structures for two-edge connectivity in Planar Graphs" Theoret. Comput. Sci. 130 (1994), 139-161.
11. R. Gupta and M. L. Soffa, "Region scheduling" Proc. 2nd International Conference on Supercomputing, (1987), 141-148.
12. R. Johnson and K. Pingali, "Dependence-based program analysis" Proc. Sigplan'93 PLDI, 78-89.
13. Published as ACM SIGPLAN Notices 28(6).
14. R. Johnson, D. Pearson, and K. Pingali, "Finding Regions Fast: Single Entry Single Exit and Control Regions in Linear Time." To appear in Proc. Sigplan'94 PLDI.
15. H. Nagamochi and T. Ibaraki. Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7, pages 583 - 596, 1992.
16. M. H. Rauch. "Improved Data Structures for Fully Dynamic Biconnectivity" to appear in Proc. 26 Annual Symp. on Theory of Computing, 1994.
17. D. D. Sleator, R. E. Tarjan, "A Data Structure for Dynamic Trees" J. Comput. System Sci. 24 (1983), 362-381.
18. A. Yao, "Should tables be sorted", J. Assoc. Comput. Mach., 28(3), 1981, 615-628.