A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1991, Pages 188-194

  Alizadeh, Farid ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; OPTIMIZATION; PARALLEL ALGORITHMS;

INTERIOR-POINT METHOD; MATRIX OPERATIONS; MAXIMUM CLIQUE; MAXIMUM CLIQUE PROBLEMS; PERFECT GRAPH; SUBLINEAR; SUBLINEAR TIME; TIME COMPLEXITY;

GRAPHIC METHODS;

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

References (20)

1. A. Fiaco and G. McCormick, Nonlinear Programming, Sequential Unconstrained Minimization Techniques, Research Analysis Corporation, 1968, New edition: SIAM 1990.
2. R. Fletcher, Semi-Definite Matrix Constraints in Optimization, SIAM Journal on Control and Optimization, 23, July 1985.
3. S. Friedland, J. Nocedal, and M. Overton, The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems, SIAM Journal on Numerical Analysis, 24(3), June 1987.
4. P. Gill, W. Murray, and M. Wright, Practical Optimization, Academic Press, 1981.
5. A. Goldberg, S. Plotkin, D. Shmoys, and E. Tardos, Interior-Point Methods in Parallel Computation (Extended Abstract), Manuscript, April 1989.
6. M. Grotschel, L. Lovasz, and A. Schrijver, The Ellipsoid Method and its Consequences in Combinatorial Optimization, Combinatorica, 1 (2) (1981).
7. -, Relaxations of Vertex Packing, Journal of Combinatorial Theory, Series B 40, 1986.
8. -, Polynomial Algorithms for Perfect Graphs, Annals of Discrete Mathematics 21 (1984).
9. -, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, 1988
10. H. Karloff, A Las Vegas RNC Algorithm for Maximum Matching, Combinatorica 6 (4) 1986.
11. R. Karp, E. Upfal, A. Widgerson, Constructing A perfect Matching is in Random NC, Combinatorica, 6 (1) 1986.
12. L. Lovasz, Normal Hypergraphs and the Weak Perfect Graph Conjecture, Discrete Math 2 (1972).
13. -, On the Shannon Capacity of a Graph, IEEE Transactions on Information Theory, Vol. IT-25, no. 1, January 1979.
14. -, Perfect Graphs, in selected Topics in Graph Theory 2, edited by L. Beineke, and R. Wilson. Academic Press, 1983.
15. -, An Algorithmic Theory of Numbers, Graphs and Convexity, CBMS-NSF50, SIAM, 1986.
16. K. Mulmuley, U. Vazirani, V. Vazirani, Matching is as Easy as Matrix Inversion, Combinatorica 7 (1) 1987.
17. Y. Nesterov, A. Nemirovsky, Self-Concordant Functions and Polynomial Time Methods in Convex Programming, expanded edition, Moscow, April 1990.
18. M. Overton, On minimizing the Maximum Eigenvalue of a Symmetric Matrix, SIAM Journal on Matrix Analysis and Applications, vol. 9, no. 2, April 1988.
19. -, Large-Scale Optimization of Eigenvalues, Manuscript, NYU Computer Science Department report no. 505, May 1990.
20. 3L) Potential Reduction Algorithm for Linear Programming, Manuscript, The University of Iowa, 1989.