Algorithms for graph partitioning on the planted partition model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1671, Issue , 1999, Pages 221-232

  Condon, Anne ^a   Karp, Richard M ^b  

^a University of Wisconsin Madison   (United States)

^b University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; CLUSTERING ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; PROBABILITY; RANDOM PROCESSES;

GRAPH BISECTION; GRAPH PARTITIONING; LINEAR-TIME ALGORITHMS; OPTIMAL PARTITIONS; PARTITION PROBLEM; PLANTED PARTITION; PROBABILITY P; UNDIRECTED GRAPH;

OPTIMIZATION;

EID: 84958747786     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48413-4_23     Document Type: Conference Paper

References (14)

1. S. Arora, D. Karger and M. Karpinski. “Polynomial time approximation schemes for dense instances of NP-hard problems,” in Proc. 27th Annual ACM Symp. on Theory of Computing, 1995, 284-293.
2. T. Bui. “On bisecting random graphs,” Report Number MITιLCSιTR-287, Lab­oratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1983.
3. T. Bui, S. Chaudhuri, T. Leighton, and M. Sipser. “Graph bisection algorithms with good average case behavior,” Combinatorica, 7:2 (1987), 171-191.
4. R. B. Boppana. “Eigenvalues and graph bisection: an average-case analysis,” in Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, 1987, 280-285.
5. M. E. Dyer and A. M. Frieze. “Fast solution of some random NP-hard problems,” in Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, 1986, 331-336.
6. W. Feller. An introduction to probability theory and its applications, Volume 1, Third Edition, John Wiley and Sons, New York, 1968.
7. C. M. Fiduccia and R. M. Mattheyses. “A linear-time heuristic for improving net­work partitions,” in Proceedings of the ACM IEEE Nineteenth Design Automation Conference, 1982, 174-181.
8. A. Frieze and R. Kannan. “The regularity lemma and approximation schemes for dense problems,” in Proceedings of the 37th Annual IEEE Symposium on Founda­tions of Computer Science, 1996, 12-20.
9. M. R. Garey, D. S. Johnson, and L. Stockmeyer. “Some simplified NP-complete graph problems,” Theoretical Computer Science, 1 (1976), 237-267.
10. M. Jerrum and G. B. Sorkin. “Simulated Annealing for graph bisection,” in Pro­ceedings of the S4th Annual IEEE Symposium on the Foundations of Computer Science, 1993, 94-103.
11. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon. “Optimization by simulated annealing: an experimental evaluation; part 1, graph partitioning,” Operations Research, 37:6 (Nov-Dee 1989), 865-892.
12. A. Juels. Topics in Black Box Optimization, Ph.D. Thesis, EECS Dept., U. Cali­fornia at Berkeley, 1996.
13. B. W. Kernighan and S. Lin. “An efficient heuristic procedure for partitioning graphs,” Bell. Syst. Tech. J. 49, 291-307.
14. V. V. Petrov. Sums of independent random variables, Springer-Verlag, New York, 1975.