Clique partitions, graph compression and speeding-up algorithms

Journal of Computer and System Sciences

Volumn 51, Issue 2, 1995, Pages 261-272

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

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0029392998     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1995.1065     Document Type: Article

References (27)

1. P. K. Agarwal, N. Alon, B. Aronov, and S. Suri, Can visibility graphs be represented compactly?, in "Proceedings, Ninth Annual Symposium on Computational Geometry, 1993, " pp. 338-347.
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, in "Proceedings, 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. Dokl 11 (1970), 1277-1280.
5. P. Erdos and J. H. Spencer, "Probabilistic Methods in Combinatorics, " Academic Press, New York/London, 1974.
6. S. Even, An algorithm for determining whether the connectivity of a graph is at least k. SIAM J. Comp. 4 (1975), 393-396.
7. S. Even, "Graph Algorithms, " Comput. Sci. Press, New York, 1979.
8. S. Even and R. E. Tarjan, Network flow' and testing graph connectivity, SIAM J. Comput. 4 (1975), 507-518.
9. T. Feder, 2-satisfiability and network flow, Aigorithmica 11 (1994), 291-319.
10. M. L. Fredman, New bound on the complexity of the shortest path problems, SIAM J. Comput. 5 (1976), 83-89.
11. H. Gabow, A matroid approach to finding edge connectivity and packing arborescences, in "Proceedings, 23rd ACM Symposium on Theory of Computing, 1991", pp. 112-124.
12. Z. Galil, Finding the vertex connectivity of graphs, SIAM J. Comput. 9(1980), 197-199.
13. R. L. Graham, B. L. Rothschild, and J. H. Spencer. "Ramsey Theory, " Wiley, New York, 1980.
14. I. Holyer, The NP-completeness of some edge partitioning problems, SIAM J. Comput. 10 (1981), 713-717.
15. J. E. Hopcroft and R. M. Karp, An O(n5/2) algorithm for maximum matchings in bipartite graphs, SIAM J. Comput. 2 (1973), 225-231.
16. D. W. Matula, Determining edge connectivity in O(nm), in "Proceedings, 28th IEEE Symposium on Foundations of Computer Science, 1987, " pp. 249-251.
17. R. Motwani, J. Naor, and M. Naor, The probabilistic method yields deterministic parallel algorithms, in "Proceedings, 30th Annual Symposium on the Foundations of Computer Science, 1989."
18. Y. Mansour and B. Schieber, Finding the edge connectivity of directed graphs, J. Algorithms 10 (1989), 76-85.
19. S. Micali and V. Vazirani, An O(|V|0.5) algorithm for finding maximum matchings in general graphs, in "Proceedings. 21st IEEE Symposium on Foundations of Computer Science, 1980, " pp. 17-27.
20. M. Naor, Succinct representations of general unlabeled graphs. Discrete Appl. Math. 28 (1990), 303-308.
21. H. Nagamochi and T. Ibaraki, A linear-time algorithm for finding a sparse k-connected spanning subgraph of a Ar-connected graph, Aigorithmica 7 (1992), 583-596.
22. P. Ragliavan, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Coinput. System Sci. 37 (1988), 130-143.
23. F. Romani, Shortest-path problem is not harder than matrix multiplication. Inform. Process. Lett. II (1980), 134-136.
24. J. Spencer, "Ten Lectures on the Probabilistic Method, " SIAM, Philadelphia. 1987.
25. G. Turan. On the succinct representation of graphs. Discrete Appl. Math. 8 (1984), 289-294.
26. Z. Tuza, Covering of graphs by complete bipartite sub graphs: Complexity of 0-1 matrices. Combinatorial 4 (1984), 111-116.
27. K. Zarankiewicz. Problem P. 101, Colloq. Math. 2 (1951), 301.