Clique partitions, graph compression and speeding-up

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130073, Issue , 1991, Pages 123-133

  Feder, Tomás ^a   Motwani, Rajeev ^b  

^a TELCORDIA TECHNOLOGIES   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; ECONOMIC AND SOCIAL EFFECTS;

BEST-KNOWN ALGORITHMS; CLIQUE PARTITION; EDGE CONNECTIVITY; GRAPH COMPRESSIONS; GRAPH PARTITIONING; OPTIMAL COMPRESSION; PARTITIONING ALGORITHMS; VERTEX CONNECTIVITY;

GRAPH THEORY;

EID: 85024252288     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. N. Blum, "A New Approach to Maximum Matchings in General Graphs, " ICALP 1990, pp. 586-597.
2. J. Cheriyan, T. Hagerup and K. Mehlhorn, "Fast and Simple Network Flow Algorithms, " Preprint, 1990.
3. J. Cheriyan and R. Thurimella, "Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates, " Proceedings of the 23rd ACM Symposium on Theory of Computing, 1991.
4. E. A. Dinic, "Algorithm for solution of a problem of maximum flow in a network with power estimation, " Soviet Math. Doklady, vol. 11 (1970), pp. 1277-1280.
5. P. Erdos and J. H. Spencer, Probabilistic Methods in Combinatorics. Academic Press, 1974.
6. S. Even, "An algorithm for determining whether the connectivity of a graph is at least k, " SIAM Journal on Computzng, vol. 4 (1975), pp. 393-396.
7. S. Even and R. E. Tarjan, "Network flow and testing graph connectivity, " SIAM Journal on Computing, vol. 4 (1975), pp. 507-518.
8. T. Feder, "2-Satisfiability and Network Flow, " submitted to Algorithrntca.
9. M, L. Fredman, "New bounds on the complexity of the shortest path problems, " SIAM Journal on Computtng, vol. 5 (1976), pp. 83-89.
10. Z. Galil, "Finding the Vertex Connectivity of Graphs, " SIAM Journal on Gomptifang, vol. 9 (1980), pp. 197-199.
11. R. L, Graham, B. L. Rothschild and J. H. Spencer, Ramsey Theory. John Wiley & Sons, 1980.
12. I. Holyer, "The NP-completeness of some edge partitioning problems, " SIAM Journal on Computing, vol. 10 (1981), pp. 713-717.
13. J. E. Hopcroft and R. M. Karp, "An 0(n5/2) algorithm for maximum matchings in bipartite graphs, " SIAM Journal on Computing, vol. 2 (1973), pp. 225-231.
14. D. W. Matula, "Determining Edge tivit y in O(nrn) , " Proceedings of IEEE Symposium on Foundations puter Science, (1987), pp. 249-251.
15. R. Motwani, J. Naor and M. Naor, "The probabilistic method yields deterministic parallel algorithms, " 30th A nnuai Symposium on the Foundations of Computer Science, 1989
16. S. Micali and V. Vazirani, (An 0(lV15 . Il?l) Algorithm for Finding Maximum Matchings in General Graphs, " Proceedings of the 21st IEEE Symposium on Foundations of Computer Science, (1980), pp. 17-27.
17. M. Naor, "Succinct representations of general unlabeled graphs, " Discrete Applied Mathematics, vol. 28 (1990), pp. 303-308.
18. H. Nagamochi and T. Ibaraki, "Linear Time Algorithms for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph, " Algorithmic, to appear.
19. P. Raghavan, "Probabilistic construction of deterministic algorithms: Approximating packing integer programs, " JCSS, VO1. 37 (1988), pp. 130-143.
20. F. Romani, "Shortest-path problem is not harder than matrix multiplication, " Information Processing Letters, vol. 11 (1980), pp. 134-136.
21. J. Spencer, Ten !ectures on the probabilistic method. SIAM (Philadelphia), 1987.
22. G. Turan, "On the Succinct Representation of Graphs, " Discrete Applied Mathematics, vol. 8 (1984), pp. 289-294.
23. K. Zarankiewicz, Problem P. 101, Colloq. Math., vol. 2 (1951), p. 301.