Skip to main content
Springer Nature Link
Log in

Vertex packing algorithms

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

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

Included in the following conference series:

  • 232 Accesses

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

  • E.Balas (1984): Lecture in Osnabrück, August.

    Google Scholar 

  • L.W. Beineke (1970): Characterizations of derived graphs, Z. Comlin. Theory 6, 129–135.

    Google Scholar 

  • C.Berge and V.Chvátal, eds., (1984): Topics on Perlect graphs, Annals of Discrete Math. 21; North-Holland.

    Google Scholar 

  • M. Boulala and J.P. Uhry (1979): Polytope des independentes d'un graph series-parallele, Discrete Math. 27, 225–243.

    Article  Google Scholar 

  • J. Edmonds (1965): Maximum matching and a polyhedron with 0,1-vertices, Z. Res. Natl. Bureau of Standards B 69, 125–130.

    Google Scholar 

  • J. Fonlupt and J.P. Uhry (1982): Transformations which preserve perfectness and h-perfectness of graphs, Annals of Discrete Math. 16, 83–95.

    Google Scholar 

  • A.Frank (1976): Some polynomial algorithms for certain graphs and hypergraphs, Comlinatorics, Proc. 5th British Combin.Conf., Aberdeen 1975; Utilitas Mathematica, 211–226.

    Google Scholar 

  • A.M.Gerards and A.Schrijver (1985): Matrices with the Edmonds-Johnson property, working paper, Inst. of Operations Research, Univ.Bonn.

    Google Scholar 

  • M.Golumbic (1980): Algorithmic Graph Theory and Perfect Graphs, Academic Press.

    Google Scholar 

  • M. Grötschel, L. Lovász and A. Schrijver (1981): The ellipsoid method and its consequences in combinatorial optimization, Comlinatorica 1, 169–197.

    Google Scholar 

  • M.Grötschel, L.Lovász and A.Schrijver (1984): Geometric methods in combinatorial optimization, Progress in Comlinatorial Optimization, Proc. Silver Jubilee Conf. Waterloo 1982; Academic Press, 167–183.

    Google Scholar 

  • M.Grötschel, L.Lovász and A.Schrijver (1985): Relaxations of vertex packing, Z. Comlin. Theory B (submitted)

    Google Scholar 

  • P.L.Hammer, N.V.R.Mahadev and D.de Werra (1985): The struction of a graph: Application to CN-free graphs, Comlinatorica 5 (to appear)

    Google Scholar 

  • L. Lovász (1979): On the Shannon capacity of a graph, IEEE Trans. Inform. Theory 25, 1–7.

    Article  Google Scholar 

  • L.Lovász and M.D.Plummer (1985): Matching Theory, Akadémiai Kiadó — North-Holland.

    Google Scholar 

  • G. Minty (1980): On maximal independent sets of vertices in claw-free graphs, Z. Coml. Theory B 28, 284–304.

    Google Scholar 

  • N. Sbihi (1980): Algorithme de recherche d'un stable de cardinalité maximum dans un graph sans étoile, Discrete Math. 29, 53–76.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Eötvös Loránd University, H-1088, Budapest, Hungary

    L. Lovász

Authors
  1. L. Lovász
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wilfried Brauer

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lovász, L. (1985). Vertex packing algorithms. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015726

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15650-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation