A Separator Theorem for Planar Graphs (1977)

by Richard J. Lipton , Robert E. Tarjan
Citations:434 - 1 self

Documents Related by Co-Citation

11502 Computers and Intractability, A Guide to the Theory of NPCompleteness – M R Garey, D S Johnson - 1979
519 Partitioning sparse matrices with eigenvectors of graphs – A Pothen, H D Simon, K-P Liou - 1990
282 A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems – Stephen T Barnard, Horst D Simon - 1993
534 Computer Solution of Large Sparse Positive Definite Matrices – A GEORGE, J W LIU - 1981
1120 An efficient heuristic procedure for partitioning graphs – B W Kernighan, S Lin - 1970
464 A multilevel algorithm for partitioning graphs – Bruce Hendrickson, Robert Leland - 1993
84 A separator theorem for graphs of bounded genus – J R Gilbert, J P Hutchinson, R E Tarjan - 1984
505 Introduction to Parallel Computing: Design and Analysis of Algorithms – Vipin Kumar, Ananth Grama, Anshul Gupta, George Karypis - 1994
540 An Analysis of the Finite Element Method – G Strang, G J Fix - 1973