Skip to main content
SpringerLink
Log in

Cutting and partitioning a graph after a fixed pattern

Extended abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1983)

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

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. Aho, A.V., J.E. Hopcroft, J.D. Ullman, “The Design and Analysis of Computer Algorithms”, Addison-Wesley, 1974.

    Google Scholar 

  2. Bhatt, S.N., C.E. Leiserson, “How to Assemble Tree Machines” Proc. 14th SIGACT, pp.77–84, 1980.

    Google Scholar 

  3. Dilworth, R.P., “A Decomposition Theorem for Partially Ordered Sets”, Ann. of Math. (1), vol. 51, pp. 161–166, 1950.

    Google Scholar 

  4. Fortune S., J.E. Hopcroft, J. Wyllie, “The Directed Subgraph Homeomorphism Problem”, Theor. Comput. Sci. (10), pp. 111–121, 1980.

    Google Scholar 

  5. Golumbic, M. C., “The Complexity of Comparability Graph Recognition and Coloring”, Computing (18), pp. 199–208, 1977.

    Google Scholar 

  6. Garey, M.R., Johnson, D.S., “Computers and Intractability: A Guide to the Theory of NP-Completeness” Freeman, 1979.

    Google Scholar 

  7. Hoffman A., private communication, 1982.

    Google Scholar 

  8. Johnson, D. S., “The NP-Completeness Column: An Ongoing Guide”, J. of Algorithms (3), pp. 182–195, 1982.

    Google Scholar 

  9. Leighton, F.T., “A Layout Strategy for VLSI which is Provably Good”, Proc. 14th SIGACT, pp. 85–98, 1980.

    Google Scholar 

  10. Lipton, R.J., Tarjan, R.E., “A Separator Theorem for Planar Graphs”, SIAM J. Applied Math., vol. 36, no. 2, pp. 177–189, 1979.

    Google Scholar 

  11. Lipton, R.J., Tarjan, R.E., “Applications of a Planar Separator Theorem”, SIAM J. Comput., vol. 9, no. 3, pp. 615–626, 1980.

    Google Scholar 

  12. Papadimitriou, C.H., K. Steiglitz, “Combinatorial Optimization: Algorithms and Complexity” Prentice Hall, 1982.

    Google Scholar 

  13. Papadimitriou, C.H., M. Yannakakis, “The Complexity of Restricted Spanning Tree Problems” JACM, vol 29, no. 2, pp. 285–310, 1982.

    Google Scholar 

  14. Yannakakis M., “Node-and Edge-deletion NP-complete Problems” Proc. 10th SIGACT, pp. 253–264, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bell Labs, USA

    Mihalis Yannakakis

  2. Brown Univ., USA

    Paris C. Kanellakis

  3. MIT, USA

    Stavros S. Cosmadakis

  4. MIT and Nat. Tech. Univ. of Athens, Greece

    Christos H. Papadimitriou

Authors
  1. Mihalis Yannakakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paris C. Kanellakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stavros S. Cosmadakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Christos H. Papadimitriou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josep Diaz

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yannakakis, M., Kanellakis, P.C., Cosmadakis, S.S., Papadimitriou, C.H. (1983). Cutting and partitioning a graph after a fixed pattern. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036950

Download citation

  • DOI: https://doi.org/10.1007/BFb0036950

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12317-0

  • Online ISBN: 978-3-540-40038-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation