Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E.Balas (1984): Lecture in Osnabrück, August.
L.W. Beineke (1970): Characterizations of derived graphs, Z. Comlin. Theory 6, 129–135.
C.Berge and V.Chvátal, eds., (1984): Topics on Perlect graphs, Annals of Discrete Math. 21; North-Holland.
M. Boulala and J.P. Uhry (1979): Polytope des independentes d'un graph series-parallele, Discrete Math. 27, 225–243.
J. Edmonds (1965): Maximum matching and a polyhedron with 0,1-vertices, Z. Res. Natl. Bureau of Standards B 69, 125–130.
J. Fonlupt and J.P. Uhry (1982): Transformations which preserve perfectness and h-perfectness of graphs, Annals of Discrete Math. 16, 83–95.
A.Frank (1976): Some polynomial algorithms for certain graphs and hypergraphs, Comlinatorics, Proc. 5th British Combin.Conf., Aberdeen 1975; Utilitas Mathematica, 211–226.
A.M.Gerards and A.Schrijver (1985): Matrices with the Edmonds-Johnson property, working paper, Inst. of Operations Research, Univ.Bonn.
M.Golumbic (1980): Algorithmic Graph Theory and Perfect Graphs, Academic Press.
M. Grötschel, L. Lovász and A. Schrijver (1981): The ellipsoid method and its consequences in combinatorial optimization, Comlinatorica 1, 169–197.
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.
M.Grötschel, L.Lovász and A.Schrijver (1985): Relaxations of vertex packing, Z. Comlin. Theory B (submitted)
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)
L. Lovász (1979): On the Shannon capacity of a graph, IEEE Trans. Inform. Theory 25, 1–7.
L.Lovász and M.D.Plummer (1985): Matching Theory, Akadémiai Kiadó — North-Holland.
G. Minty (1980): On maximal independent sets of vertices in claw-free graphs, Z. Coml. Theory B 28, 284–304.
N. Sbihi (1980): Algorithme de recherche d'un stable de cardinalité maximum dans un graph sans étoile, Discrete Math. 29, 53–76.
Author information
Authors and Affiliations
Editor information
Rights 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