Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. H.N. Djidjev. On the problem of partitioning planar graphs, SIAM J. Algebr. Discr. Methods 3, 1982, 229–241.
2. H.N. Djidjev. A separator theorem for graphs of fixed genus, SERDICA, Vol. 11, 1985, pp. 319–329.
3. H. Gazit, G.L. Miller. A parallel algorithm for finding a separator for planar graphs. In: Proc. 28-th Foundations of Computer Science, IEEE, 1987, 238–248.
4. J.R. Gilbert. Graph separator theorem and sparse Gaussean elimination, Ph. D. Thesis, Stanford University, 1980.
5. J.R. Gilbert, J.P. Hutchinson, R.E. Tarjan. A separator theorem for graphs of bounded genus, Journal of Algorithms, No 5, 1984, pp. 391–398.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献