Skip to main content
SpringerLink
Log in

Linear algorithms for graph separation problems

  • Conference paper
  • First Online:
SWAT 88 (SWAT 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 318))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.N. Djidjev. On the problem of partitioning planar graphs, SIAM J. Algebr. Discr. Methods 3, 1982, 229–241.

    Google Scholar 

  2. H.N. Djidjev. A separator theorem for graphs of fixed genus, SERDICA, Vol. 11, 1985, pp. 319–329.

    Google Scholar 

  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.

    Google Scholar 

  4. J.R. Gilbert. Graph separator theorem and sparse Gaussean elimination, Ph. D. Thesis, Stanford University, 1980.

    Google Scholar 

  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.

    Google Scholar 

  6. R.J. Lipton, R.E. Tarjan. A separator theorem for planar graphs, SIAM J. Appl. Math., Vol. 36, No 2, 1979, pp. 177–189.

    Google Scholar 

  7. R.J. Lipton, R.E. Tarjan. Applications of a planar separator theorem, SIAM J. Computing, Vol. 9, No 3, 1980, pp. 615–627.

    Google Scholar 

  8. G.L. Miller. Finding small simple cycle-separators for 2-connected planar graphs, J. of Comp. and System Science, Vol. 32, 1986, pp. 265–279.

    Google Scholar 

  9. S. Rao. Finding near optimal separators in planar graphs, In: Proc. 28-th Foundations of Computer Science, IEEE, 1987, pp. 225–237.

    Google Scholar 

  10. S.M. Venkatesan, Improved constants for some separator theorems, J. of Algorithms, Vol. 8, 1987, 572–578.

    Google Scholar 

  11. S.M. Venkatesan. On cleaving a planar graph, manuscript, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center of Informatics and Computer Technology Bulgarian Academy of Sciences, Acad. G. Bonchev str., bl. 25-A, 1113, Sofia, Bulgaria

    Hristo N. Djidjev

Authors
  1. Hristo N. Djidjev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf Karlsson Andrzej Lingas

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Djidjev, H.N. (1988). Linear algorithms for graph separation problems. In: Karlsson, R., Lingas, A. (eds) SWAT 88. SWAT 1988. Lecture Notes in Computer Science, vol 318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-19487-8_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19487-3

  • Online ISBN: 978-3-540-39288-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation